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!)
A081056 Number of partitions of 2n+1 in which no parts are multiples of 4. 4

%I #16 Sep 11 2019 09:51:11

%S 1,3,6,12,22,38,64,105,166,258,395,592,876,1280,1846,2636,3728,5222,

%T 7256,10006,13696,18624,25169,33808,45164,60022,79366,104457,136870,

%U 178572,232044,300368,387366,497804,637568,813910,1035792,1314214

%N Number of partitions of 2n+1 in which no parts are multiples of 4.

%C Euler transform of period 16 sequence [3,0,2,1,2,1,3,0,3,1,2,1,2,0,3,0,...].

%H Seiichi Manyama, <a href="/A081056/b081056.txt">Table of n, a(n) for n = 0..10000</a>

%F G.f.: (sum_{n>=0} x^A074377(n))/(sum_n (-x)^n^2).

%F a(n) = A001935(2n+1).

%F a(n) ~ exp(Pi*sqrt(n)) / (2^(7/2) * n^(3/4)). - _Vaclav Kotesovec_, Nov 15 2017

%t Table[Count[IntegerPartitions[2n+1],_?(Total[Boole[Divisible[#,4]]]==0&)],{n,0,40}] (* _Harvey P. Dale_, Sep 11 2019 *)

%o (PARI) a(n)=local(X); if(n<0,0,X=x+x^2*O(x^(2*n)); polcoeff(eta(X^4)/eta(X),2*n+1))

%Y Cf. A001935, A074377, A081055.

%K nonn,easy

%O 0,2

%A _Michael Somos_, Mar 03 2003

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 September 1 10:29 EDT 2024. Contains 375584 sequences. (Running on oeis4.)