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!)
A088932 G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)). 5

%I #35 May 02 2018 10:15:16

%S 1,2,4,6,10,14,20,26,36,46,60,74,94,114,140,166,201,236,280,324,380,

%T 436,504,572,656,740,840,940,1060,1180,1320,1460,1625,1790,1980,2170,

%U 2390,2610,2860,3110,3396,3682,4004,4326,4690,5054,5460,5866,6321,6776,7280,7784

%N G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)).

%C a(n) is the number of partitions of 2*n into powers of 2 less than or equal to 2^4. First differs from A000123 at n=16. - _Alois P. Heinz_, Apr 02 2012

%H Alois P. Heinz, <a href="/A088932/b088932.txt">Table of n, a(n) for n = 0..2000</a>

%H N. J. A. Sloane and J. A. Sellers, <a href="https://arxiv.org/abs/math/0312418">On non-squashing partitions</a>, arXiv:math/0312418 [math.CO], 2003.

%H N. J. A. Sloane and J. A. Sellers, <a href="https://doi.org/10.1016/j.disc.2004.11.014">On non-squashing partitions</a>, Discrete Math., 294 (2005), 259-274.

%H <a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-2,2,-2,0,2,0,-2,0,2,-2,2,0,-2,1).

%F a(n) = (8*floor(n/4)^4 + 8*(m+8)*floor(n/4)^3 - 2*(m^3 - 6*m^2 - 19*m - 86)*floor(n/4)^2 -8*(m^3 - 6*m^2 - 6*m - 22)*floor(n/4) - 7*m^3 + 42*m^2 + 13*m + 54 - (m^3 - 6*m^2 + 5*m + 6)*(-1)^floor(n/4))/48 where m = n mod 4. - _Luce ETIENNE_, Apr 07 2018

%p f := proc(n,k) option remember; if k > n then RETURN(0); fi; if k= 0 then if n=0 then RETURN(1) else RETURN(0); fi; fi; if k = 1 then RETURN(1); fi; if n mod 2 = 1 then RETURN(f(n-1,k)); fi; f(n-1,k)+f(n/2,k-1); end; # present sequence is f(2m,5)

%p GFF := k->x^(2^(k-2))/((1-x)*mul((1-x^(2^j)),j=0..k-2)); # present g.f. is GFF(5)/x^8

%p a:= proc(n) local m, r; m := iquo(n, 8, 'r'); r:= r+1; [1, 2, 4, 6, 10, 14, 20, 26][r]+ (((8/3*m +(4*r +28)/3)*m +[0, 4, 9, 14, 20, 26, 33, 40][r] +43/3)*m +[22, 33, 50, 67, 93, 119, 154, 189][r]/3)*m end: seq(a(n), n=0..60); # _Alois P. Heinz_, Apr 17 2009

%t CoefficientList[Series[1/((1-x)^2(1-x^2)(1-x^4)(1-x^8)), {x,0,60}], x] (* _Harvey P. Dale_, Apr 22 2011 *)

%t Table[1 + 1237*n/1536 + 17*n^2/96 + 13*n^3/768 + n^4/1536 + (5/32 + n/32) * Floor[n/4] + (81/256 + 3*n/32 + n^2/128) * Floor[n/2] - Floor[(n+1)/8]/4 - (n+3) * Floor[(n+1)/4]/32 - Floor[(n+2)/8]/4, {n, 0, 100}] (* _Vaclav Kotesovec_, May 02 2018 *)

%t Table[Simplify[1023/1024 + 85*n/96 + 341*n^2/1536 + n^3/48 + n^4/1536 + (-1)^n*(113/1024 + n/32 + n^2/512) - (1 + Sqrt[2])*Cos[Pi*n/4]/16 + Cos[Pi*n/2]/64 + (Sqrt[2] - 1) * Cos[3*Pi*n/4]/16 + (1/8 + n/64)*Sin[Pi*n/2]], {n, 0, 100}] (* _Vaclav Kotesovec_, May 02 2018 *)

%o (PARI) Vec(1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8))+O(x^99)) \\ _Charles R Greathouse IV_, Sep 03 2011

%Y See A000027, A002620, A008804, A088954, A000123 for similar sequences.

%Y Column k=4 of A181322.

%Y Cf. A010873.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, Dec 02 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 March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)