|
Search: id:A133926
|
|
|
| A133926 |
|
Number of equivalence classes of compositions of n into parts of size 2 and 3 under the following equivalence relation: We make a "move" by changing three consecutive 2s into two consecutive 3s or vice versa. Two compositions are equivalent if we can reach one from the other by a series of moves. |
|
+0
1
|
|
| 1, 1, 1, 2, 1, 3, 2, 3, 4, 3, 6, 4, 7, 7, 7, 11, 8, 14, 12, 15, 19, 16, 26, 21, 30, 32, 32, 46, 38, 57, 54, 63, 79, 71, 104, 93, 121, 134, 135, 184, 165, 226, 228, 257, 319, 301
(list; graph; listen)
|
|
|
OFFSET
|
2,4
|
|
|
COMMENT
|
Sequence A133925 counts the equivalence classes with exactly one element.
|
|
LINKS
|
Problem posed on the Art of Problem Solving forum, String Replacement
|
|
EXAMPLE
|
a(5) = 2 because the two compositions 23 and 32 are inequivalent. a(6) = 1 because the two compositions 222 and 33 are equivalent.
|
|
CROSSREFS
|
Sequence in context: A158206 A164988 A115872 this_sequence A144337 A143929 A153583
Adjacent sequences: A133923 A133924 A133925 this_sequence A133927 A133928 A133929
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Joel Lewis (jblewis(AT)post.harvard.edu), Jan 07 2008, Jan 23 2008
|
|
|
Search completed in 0.002 seconds
|
