login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161090 Number of partitions of n into squares where every part appears at least 2 times 1
0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 3, 5, 4, 6, 5, 6, 6, 7, 6, 8, 8, 9, 9, 11, 10, 13, 11, 14, 14, 16, 15, 18, 18, 20, 19, 22, 22, 25, 24, 27, 28, 32, 29, 36, 34, 39, 38, 42, 42, 47, 45, 51, 51, 56, 55, 62, 61, 68, 66, 75, 73, 82, 79, 88, 88, 96, 93, 104, 105, 112, 113, 122, 123 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

FORMULA

G.f.=-1+Product[1+x^(2j^2)/(1-x^(j^2)), j=1..infinity)]. [From Emeric Deutsch, Jun 21 2009]

EXAMPLE

Contribution from Emeric Deutsch, Jun 21 2009: (Start)

a(12)=3 because we have 444, 441111, and 1^(12).

(End)

MAPLE

g := -1+product(1+x^(2*j^2)/(1-x^(j^2)), j = 1 .. 10): gser := series(g, x = 0, 90): seq(coeff(gser, x, n), n = 1 .. 79); [From Emeric Deutsch, Jun 21 2009]

CROSSREFS

Sequence in context: A059169 A026922 A178696 * A178697 A255065 A027349

Adjacent sequences:  A161087 A161088 A161089 * A161091 A161092 A161093

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 02 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 22 09:35 EST 2017. Contains 295076 sequences.