|
Search: id:A160648
|
|
| |
|
| 0, 1, 0, 0, 2, 0, 1, 4, 2, 3, 9, 6, 11, 19
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
A160644 bisects sequence A053445 which counts unrestricted partitions such
that the two largest values match and that no part is less than two.
Conjecture: a(n) counts unrestricted partitions of even numbers such that
the three largest values match and that, after "222", no part is less than three.
|
|
EXAMPLE
|
a(n) begins 0 1 0 0 2 0 1 4 2 3 9 ... and counts 222; 444,3333;
666,5553,444433,333333; 5555,44444; 6664,55543,444433;
888,6666,7773,55554,66633,444444,555333,4443333,33333333; ...
|
|
CROSSREFS
|
A000041 A002865 A053445 A160644 A160646
Sequence in context: A158239 A159819 A030188 this_sequence A124912 A138752 A098689
Adjacent sequences: A160645 A160646 A160647 this_sequence A160649 A160650 A160651
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Alford Arnold (Alford1940(AT)aol.com), May 25 2009
|
|
|
Search completed in 0.002 seconds
|
