|
Search: id:A001993
|
|
|
| A001993 |
|
Number of two-rowed partitions of length 3.
(Formerly M2452 N0973)
|
|
+0
6
|
|
| 1, 1, 3, 5, 9, 13, 22, 30, 45, 61, 85, 111, 150, 190, 247, 309, 390, 478, 593, 715, 870, 1038, 1243, 1465, 1735, 2023, 2368, 2740, 3175, 3643, 4189, 4771, 5443, 6163, 6982, 7858, 8852, 9908, 11098, 12366, 13780, 15284, 16958, 18730, 20692, 22772, 25058
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
G. E. Andrews, MacMahon's Partition Analysis II: Fundamental Theorems, Annals Combinatorics, 4 (2000), 327-338.
A. Cayley, Calculation of the minimum N.G.F. of the binary seventhic, Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 10, p. 408-419.
|
|
FORMULA
|
G.f.: 1/((1-x)*(1-x^2)^2*(1-x^3)^2*(1-x^4)).
|
|
CROSSREFS
|
Sequence in context: A049691 A136252 A052282 this_sequence A133033 A134672 A082874
Adjacent sequences: A001990 A001991 A001992 this_sequence A001994 A001995 A001996
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 09 2000
|
|
|
Search completed in 0.002 seconds
|
