|
Search: id:A111178
|
|
|
| A111178 |
|
Number of partitions of n into positive numbers one less than a square. |
|
+0
3
|
|
| 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 4, 1, 2, 4, 1, 2, 5, 2, 4, 5, 2, 5, 5, 2, 6, 7, 4, 6, 7, 5, 6, 8, 6, 8, 12, 6, 9, 13, 6, 10, 15, 8, 14, 15, 9, 16, 16, 10, 18, 21, 14, 19, 22, 16, 20, 24, 19, 25, 30, 20, 27, 33, 21, 29, 39, 26, 37, 40, 28, 42, 42, 31, 48
(list; graph; listen)
|
|
|
OFFSET
|
0,16
|
|
|
COMMENT
|
Also limiting form of the number of representations of n into k positive squares for k decreasing from n to 1, or Table[Count[SumOfSquaresRepresentations[k,n], {a_,__}/;a>0], {n,100,100},{k,100,40,-1}]. (Franklin T. Adams-Watters: replacing k^2 ones by the value k^2 changes the count by k^2-1).
|
|
FORMULA
|
product(k=1..inf, 1/(1-x^(k^2-1)))
|
|
MATHEMATICA
|
Product[1/(1-x^(k^2-1)), {k, 2, 100}]
|
|
CROSSREFS
|
Cf. A001156, A078134.
Sequence in context: A025432 A025433 A025434 this_sequence A076845 A161906 A016014
Adjacent sequences: A111175 A111176 A111177 this_sequence A111179 A111180 A111181
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Wouter Meeussen (wouter.meeussen(AT)pandora.be), Oct 22 2005
|
|
|
Search completed in 0.002 seconds
|
