The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A276409

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A276409

Number of reduced words of length n in the alphabet {U,U^(-1),S,S^(-1)} that are equal to unity if U^3 = S^2 = 1.
(history; published version)

#20 by Michael De Vlieger at Wed Aug 03 10:38:19 EDT 2022

STATUS

reviewed

approved

#19 by Michel Marcus at Wed Aug 03 10:26:25 EDT 2022

STATUS

proposed

reviewed

#18 by Andrey Zabolotskiy at Wed Aug 03 10:23:42 EDT 2022

STATUS

editing

proposed

#17 by Andrey Zabolotskiy at Wed Aug 03 10:17:42 EDT 2022

DATA

1, 0, 2, 2, 6, 24, 44, 136, 298, 914, 2462, 6464, 17740, 47840, 133618, 366162, 1011190, 2801144, 7775916, 21680712, 60443514, 168963010, 472975278, 1326349568, 3725180524, 10475012672, 29494512354, 83141905570, 234634612198, 662840458840, 1874315939756

KEYWORD

nonn,more,changed

EXTENSIONS

Name changed , terms a(12) and beyond added using g.f. from Alkauskas by Andrey Zabolotskiy, Aug 03 2022

#16 by Andrey Zabolotskiy at Wed Aug 03 10:09:52 EDT 2022

NAME

Subsequence Number of A265434 that counts only reduced words of length n in the alphabet {U,U^(-1),S,S^(-1)} that are equal to unity if U^3 = S^2 = 1.

EXTENSIONS

Name changed by Andrey Zabolotskiy, Aug 03 2022

STATUS

approved

editing

#15 by Alois P. Heinz at Mon Oct 07 02:45:12 EDT 2019

STATUS

reviewed

approved

#14 by Joerg Arndt at Mon Oct 07 02:43:02 EDT 2019

STATUS

proposed

reviewed

#13 by Petros Hadjicostas at Mon Oct 07 02:30:59 EDT 2019

STATUS

editing

proposed

#12 by Petros Hadjicostas at Mon Oct 07 02:30:50 EDT 2019

CROSSREFS

Cf. A265434, A276408.

STATUS

approved

editing

#11 by Joerg Arndt at Mon Oct 07 02:05:13 EDT 2019

STATUS

reviewed

approved