|
Search: id:A109655
|
|
|
| A109655 |
|
Number of partitions of n^2 into up to n parts each no more than 2n, or of n(3n+1)/2 into exactly n distinct parts each no more than 3n. |
|
+0
1
|
|
| 1, 1, 3, 8, 33, 141, 676, 3370, 17575, 94257, 517971, 2900900, 16509188, 95220378, 555546058, 3273480400, 19456066175, 116521302221, 702567455381, 4261765991164, 25992285913221, 159303547578873, 980701254662294
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(n) =A067059(n, 2n) =A067059(2n, n). Slightly less than but close to (27/4)^n*sqrt(3)/(2*pi*n^2).
|
|
EXAMPLE
|
a(3)=8 since 3^2=9 can be partitioned into 3+3+3, 4+3+2, 4+4+1, 5+4, 5+3+1, 5+2+2, 6+3, or 6+2+1, while 3*(3*3+1)/2=15 can be partitioned into 6+5+4, 7+5+3, 7+6+2, 8+6+1, 8+5+2, 8+4+3, 9+5+1, or 9+4+2.
|
|
CROSSREFS
|
Adjacent sequences: A109652 A109653 A109654 this_sequence A109656 A109657 A109658
Sequence in context: A009438 A091831 A120892 this_sequence A001120 A117722 A024419
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Aug 05 2005
|
|
|
Search completed in 0.002 seconds
|
