login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087154 Number of partitions of n into distinct nonsquares. 5

%I #18 Dec 30 2016 09:51:09

%S 1,0,1,1,0,2,1,2,3,2,4,4,4,7,6,9,9,11,14,14,19,21,23,29,31,36,43,46,

%T 56,62,70,81,91,103,117,132,148,167,188,211,237,266,297,332,371,414,

%U 461,515,571,634,708,780,870,963,1062,1180,1300,1436,1588,1747,1929,2123

%N Number of partitions of n into distinct nonsquares.

%H Vaclav Kotesovec, <a href="/A087154/b087154.txt">Table of n, a(n) for n = 0..10000</a>

%F G.f.: Product_{m>0} (1+x^m)/(1+x^(m^2)). - _Vladeta Jovovic_, Jul 31 2004

%F a(n) ~ exp(Pi*sqrt(n/3) - 3^(1/4) * (sqrt(2)-1) * Zeta(3/2) * n^(1/4) / 2 - 3*(sqrt(2)-1)^2 * Zeta(3/2)^2 / (32*Pi)) / (2^(3/2) * 3^(1/4) * n^(3/4)). - _Vaclav Kotesovec_, Dec 30 2016

%e n=7: 2+5 = 7: a(7)=2;

%e n=8: 2+6 = 3+5 = 8: a(8)=3;

%e n=9: 2+7 = 3+6: a(9)=2.

%t nmax = 100; CoefficientList[Series[Product[(1 + x^k)/(1 + x^(k^2)), {k, 1, nmax}], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Dec 29 2016 *)

%o (Haskell)

%o a087154 = p a000037_list where

%o p _ 0 = 1

%o p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

%o -- _Reinhard Zumkeller_, Apr 25 2013

%Y Cf. A087153, A033461, A000041, A000037.

%Y Cf. A225045, A280264.

%K nonn

%O 0,6

%A _Reinhard Zumkeller_, Aug 21 2003

%E Zero term added by _Franklin T. Adams-Watters_, Jan 25 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)