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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092353 Expansion of (1+x^3)/((1-x)^2*(1-x^3)^2). 3

%I

%S 1,2,3,7,11,15,24,33,42,58,74,90,115,140,165,201,237,273,322,371,420,

%T 484,548,612,693,774,855,955,1055,1155,1276,1397,1518,1662,1806,1950,

%U 2119,2288,2457,2653,2849,3045,3270,3495,3720,3976,4232,4488,4777,5066,5355,5679

%N Expansion of (1+x^3)/((1-x)^2*(1-x^3)^2).

%H Vincenzo Librandi, <a href="/A092353/b092353.txt">Table of n, a(n) for n = 0..1000</a>

%H G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://neilsloane.com/doc/cliff2.html">Self-Dual Codes and Invariant Theory</a>, Springer, Berlin, 2006.

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

%F G.f.: (1+x^3)/((1-x)^2*(1-x^3)^2) = (1+x^3)/((1-x)^4*(1+x+x^2)^2).

%F a(n) = Sum(i=1..n+3, floor(i/3)^2). - _Enrique Pérez Herrero_, Mar 20 2012

%F a(n) = (1/2)*(-4*t^3 + (2n-7)*t^2 + (4n-1)*t +2n +2), where t = floor(n/3). - _Ridouane Oudra_, Oct 19 2019

%p seq(add(floor(i/3)^2, i=1..n+3), n=0..60); # _Ridouane Oudra_, Oct 19 2019

%t a[n_] := Sum[Floor[i/3]^2, {i,1,n+3}]; Table[a[n], {n, 0, 100}] (* _Enrique Pérez Herrero_, Mar 20 2012 *)

%o (Sage)

%o def A092353():

%o a, b, c, m = 0, 0, 0, 0

%o while True:

%o yield (a*(a*(2*a+9)+13)+b*(b+1)*(2*b+1)+c*(c+1)*(2*c+1)+6)//6

%o m = m + 1 if m < 2 else 0

%o if m == 0: a += 1

%o elif m == 1: b += 1

%o elif m == 2: c += 1

%o a = A092353()

%o print [a.next() for _ in range(52)] # _Peter Luschny_, May 04 2016

%Y Cf. A005993.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, Mar 20 2004

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.

Last modified February 25 11:39 EST 2020. Contains 332233 sequences. (Running on oeis4.)