Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000716
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000716 Number of partitions of n into parts of 3 kinds.
(Formerly M2788 N1123)
+0
6
1, 3, 9, 22, 51, 108, 221, 429, 810, 1479, 2640, 4599, 7868, 13209, 21843, 35581, 57222, 90882, 142769, 221910, 341649, 521196, 788460, 1183221, 1762462, 2606604, 3829437, 5590110, 8111346, 11701998, 16790136 (list; graph; listen)
OFFSET

0,2

REFERENCES

H. Gupta et al., Tables of Partitions. Royal Society Mathematical Tables, Vol. 4, Cambridge Univ. Press, 1958, p. 122.

LINKS

T. D. Noe, Table of n, a(n) for n=0..500

Index entries for expansions of Product_{k >= 1} (1-x^k)^m

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 391

N. J. A. Sloane, Transforms

FORMULA

G.f.: Product_{m>=1} 1/(1-x^m)^3.

EULER transform of 3, 3, 3, 3, 3, 3, 3, 3...

PROGRAM

(PARI) \ps100 for(n=0, 100, print1((polcoeff(1/eta(x)^3, n, x)), ", "))

CROSSREFS

Cf. A000713.

Adjacent sequences: A000713 A000714 A000715 this_sequence A000717 A000718 A000719

Sequence in context: A034505 A000711 A121589 this_sequence A001628 A099166 A054442

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

Extended with formula from Christian G. Bower (bowerc(AT)usa.net), Apr 15 1998.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research