login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096403 Number of partitions of n in which number of least parts is equal to least part. 4
1, 0, 1, 2, 2, 2, 5, 5, 9, 10, 14, 17, 26, 30, 41, 52, 67, 81, 108, 129, 168, 204, 257, 311, 393, 470, 584, 705, 865, 1036, 1270, 1514, 1838, 2192, 2639, 3137, 3767, 4455, 5321, 6287, 7469, 8794, 10419, 12230, 14427, 16904, 19863, 23210, 27207, 31701, 37039 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..51.

FORMULA

G.f.: Sum((x^(m^2)-x^(m*(m+1)))/Product(1-x^i, i=m..infinity), m=1..infinity).

G.f.: sum(n>=1, x^(n^2) / prod(k>=n+1,1-x^k)). [Joerg Arndt, Mar 23 2011]

EXAMPLE

a(7)=5 because we have 61, 421, 331, 322 and 2221.

MAPLE

G:=sum((x^(m^2)-x^(m*(m+1)))/product(1-x^i, i=m..80), m=1..80): Gser:=series(G, x=0, 70): seq(coeff(Gser, x^n), n=1..60); # Emeric Deutsch, Jul 25 2005

CROSSREFS

Cf. A006141.

Sequence in context: A326461 A326547 A326686 * A073819 A190846 A214787

Adjacent sequences:  A096400 A096401 A096402 * A096404 A096405 A096406

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Aug 07 2004

EXTENSIONS

More terms from Emeric Deutsch, Jul 25 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 18 10:31 EDT 2020. Contains 337166 sequences. (Running on oeis4.)