A008732 -id:A008732 - cp's OEIS frontend

A130520 a(n) = Sum_{k=0..n} floor(k/5). (Partial sums of A002266.)

0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 7, 9, 11, 13, 15, 18, 21, 24, 27, 30, 34, 38, 42, 46, 50, 55, 60, 65, 70, 75, 81, 87, 93, 99, 105, 112, 119, 126, 133, 140, 148, 156, 164, 172, 180, 189, 198, 207, 216, 225, 235, 245, 255, 265, 275, 286, 297, 308, 319, 330, 342, 354, 366

Offset: 0

Hieronymus Fischer, Jun 01 2007

Complementary with A130483 regarding triangular numbers, in that A130483(n) + 5*a(n) = n*(n+1)/2 = A000217(n).

Given a sequence b(n) defined by variables b(0) to b(5) and recursion b(n) = -(b(n-6) * a(n-2) * (b(n-4) * b(n-2)^3 - b(n-3)^3 * b(n-1)) - b(n-5) * b(n-3) * b(n-1) * (b(n-5) * b(n-2)^2 - b(n-4)^2 * b(n-1)))/(b(n-4) * (b(n-5) * b(n-3)^3 - b(n-4)^3 * b(n-2))). The denominator of b(n+1) has a factor of (b(1) * b(3)^3 - b(2)^3 * b(4))^a(n+1). For example, if b(0) = 2, b(1) = b(2) = b(3) = 1, b(4) = 1+x, b(5) = 4, then the denominator of b(n+1) is x^a(n+1). - Michael Somos, Nov 15 2023

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,1,-2,1).

Cf. A002264, A002265, A004526, A010872, A010873, A010874, A130481, A130482.

List([0..70], n-> Int((n-1)*(n-2)/10)); # G. C. Greubel, Aug 31 2019

[Round(n*(n-3)/10): n in [0..70]]; // Vincenzo Librandi, Jun 25 2011

seq(floor((n-1)*(n-2)/10), n=0..70); # G. C. Greubel, Aug 31 2019

Accumulate[Floor[Range[0,70]/5]] (* Harvey P. Dale, May 25 2016 *)

a(n) = sum(k=0, n, k\5); \\ Michel Marcus, May 13 2016

[floor((n-1)*(n-2)/10) for n in (0..70)] # G. C. Greubel, Aug 31 2019

a(n) = floor(n/5)*(2*n - 3 - 5*floor(n/5))/2.
a(n) = A002266(n)*(2*n - 3 - 5*A002266(n))/2.
a(n) = A002266(n)*(n -3 +A010874(n))/2.
G.f.: x^5/((1-x^5)*(1-x)^2) =  x^5/( (1+x+x^2+x^3+x^4)*(1-x)^3 ).
a(n) = floor((n-1)*(n-2)/10). - Mitch Harris, Sep 08 2008
a(n) = round(n*(n-3)/10) = ceiling((n+1)*(n-4)/10) = round((n^2 - 3*n - 1)/10). - Mircea Merca, Nov 28 2010
a(n) = A008732(n-5), n > 4. - R. J. Mathar, Nov 22 2008
a(n) = a(n-5) + n - 4, n > 4. - Mircea Merca, Nov 28 2010
a(5n) = A000566(n), a(5n+1) = A005476(n), a(5n+2) = A005475(n), a(5n+3) = A147875(n), a(5n+4) = A028895(n). - Philippe Deléham, Mar 26 2013
From Amiram Eldar, Sep 17 2022: (Start)
Sum_{n>=5} 1/a(n) = 518/45 - 2*sqrt(2*(sqrt(5)+5))*Pi/3.
Sum_{n>=5} (-1)^(n+1)/a(n) = 8*sqrt(5)*arccoth(3/sqrt(5))/3 + 92*log(2)/15 - 418/45. (End)

A118015 a(n) = floor(n^2/5).

Original entry on oeis.org

0, 0, 0, 1, 3, 5, 7, 9, 12, 16, 20, 24, 28, 33, 39, 45, 51, 57, 64, 72, 80, 88, 96, 105, 115, 125, 135, 145, 156, 168, 180, 192, 204, 217, 231, 245, 259, 273, 288, 304, 320, 336, 352, 369, 387, 405, 423, 441, 460, 480, 500, 520, 540, 561, 583, 605, 627, 649, 672

Offset: 0

Reinhard Zumkeller, Apr 10 2006

It seems that for n >= 5, a(n) is the maximum number of non-overlapping 1 X 5 rectangles that can be packed into an n X n square. Rectangles can only be placed parallel to the sides of the square. Verified with Lobato's program. - Dmitry Kamenetsky, Aug 03 2009

Ismailescu & Lee prove that for n > 6, a(n) is composite. - Charles R Greathouse IV, Jan 10 2025

Vincenzo Librandi, Table of n, a(n) for n = 0..5000
Dan Ismailescu and Yunkyu James Lee, Polynomially growing integer sequences all whose terms are composite, arXiv:2501.04851 [math.NT], 2025. See p. 1.
R. D. Lobato, Recursive partitioning approach for the Manufacturer's Pallet Loading Problem.
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,1,-2,1).

Cf. A000212, A000290, A007590, A002620, A056827, A118013, A279169.

Cf. A056834, A130519, A056838, A056865.

[ n^2 div 5: n in [0..58] ]; // Klaus Brockhaus, Nov 18 2008

Table[Floor[n^2/5], {n, 0, 60}] (* Bruno Berselli, Dec 12 2016 *)

a(n)=n^2\5 \\ Charles R Greathouse IV, Sep 24 2015

[int(n**2/5) for n in range(60)] # Bruno Berselli, Dec 12 2016

[floor(n^2/5) for n in range(60)] # Bruno Berselli, Dec 12 2016

G.f.: x^3*(1 + x)/((1 + x + x^2 + x^3 + x^4)*(1 - x)^3). - Klaus Brockhaus, Nov 18 2008
a(n) = A008732(n-4) + A008732(n-3). - R. J. Mathar, Nov 22 2008
a(5*m+r) = m*(5*m + 2*r) + a(r), with m >= 0 and 0 <= r < 5. Example: for m=4 and r=3, a(5*4+3) = a(23) = 4*(5*4 + 2*3) + a(3) = 104 + 1 = 105. - Bruno Berselli, Dec 12 2016
Sum_{n>=3} 1/a(n) = 25/16 + Pi^2/30 + sqrt(5-2*sqrt(5))*Pi/4. - Amiram Eldar, Aug 13 2022

Edited by Charles R Greathouse IV, Apr 20 2010

A008728 Molien series for 3-dimensional group [2,n ] = *22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 156, 162, 168, 174, 180, 186, 192, 198, 204, 210, 217, 224, 231, 238

Offset: 0

N. J. A. Sloane

a(n) = A179052(n) for n < 100. - Reinhard Zumkeller, Jun 27 2010

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 193
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2, -1, 0, 0, 0, 0, 0, 0, 0, 1, -2, 1).

Cf. A001840, A001972, A008724, A008725, A008726, A008727, A008732.

a:=[1,2,3,4,5,6,7,8,9,10,12,14];; for n in [13..70] do a[n]:=2*a[n-1]-a[n-2]+a[n-10]-2*a[n-11]+a[n-12]; od; a; # G. C. Greubel, Jul 30 2019

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^10)) )); // G. C. Greubel, Jul 30 2019

g:= 1/((1-x)^2*(1-x^10)); gser:= series(g, x=0,72); seq(coeff(gser, x, n), n=0..70); # modified by G. C. Greubel, Jul 30 2019

CoefficientList[Series[1/((1-x)^2(1-x^10)), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)

my(x='x+O('x^70)); Vec(1/((1-x)^2*(1-x^10))) \\ G. C. Greubel, Jul 30 2019

(1/((1-x)^2*(1-x^10))).series(x, 70).coefficients(x, sparse=False) # G. C. Greubel, Jul 30 2019

G.f.: 1/((1-x)^2*(1-x^10)).
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+10} floor(j/10).
a(n-10) = (1/2)*floor(n/10)*(2*n - 8 - 10*floor(n/10)). (End)

More terms from Vladimir Joseph Stephan Orlovsky, Mar 14 2010

A008726 Molien series 1/((1-x)^2(1-x^8)) for 3-dimensional group [2,n] = 22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 27, 30, 33, 36, 39, 42, 45, 48, 52, 56, 60, 64, 68, 72, 76, 80, 85, 90, 95, 100, 105, 110, 115, 120, 126, 132, 138, 144, 150, 156, 162, 168, 175, 182, 189, 196, 203, 210, 217, 224, 232, 240, 248, 256, 264, 272, 280

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 191
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,1,-2,1).

Cf. A001840, A001972, A008724, A008725, A008732. - Vladimir Joseph Stephan Orlovsky, Mar 14 2010

a:=[1,2,3,4,5,6,7,8,10,12];; for n in [11..80] do a[n]:=2*a[n-1] -a[n-2]+a[n-8]-2*a[n-9]+a[n-10]; od; a; # G. C. Greubel, Sep 09 2019

R:=PowerSeriesRing(Integers(), 80); Coefficients(R!( 1/((1-x)^2*(1-x^8)) )); // G. C. Greubel, Sep 09 2019

seq(coeff(series(1/(1-x)^2/(1-x^8), x, n+1), x, n), n=0..80);

CoefficientList[Series[1/((1-x)^2*(1-x^8)), {x,0,80}], x] (* Vincenzo Librandi, Jun 11 2013 *)
LinearRecurrence[{2,-1,0,0,0,0,0,1,-2,1}, {1,2,3,4,5,6,7,8,10,12}, 80] (* Harvey P. Dale, Jan 07 2015 *)

my(x='x+O('x^80)); Vec(1/((1-x)^2*(1-x^8))) \\ G. C. Greubel, Sep 09 2019

def A008726_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(1/((1-x)^2*(1-x^8))).list()
A008726_list(80) # G. C. Greubel, Sep 09 2019

G.f.: 1/((1-x)^2*(1-x^8)).
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+8} floor(j/8).
a(n-8) = (1/2)*floor(n/8)*(2*n-6-8*floor(n/8)). (End)
a(n) = 2*a(n-1) - a(n-2) + a(n-8) - 2*a(n-9) + a(n-10). - R. J. Mathar, Apr 20 2010

More terms from Vladimir Joseph Stephan Orlovsky, Mar 14 2010

Minor edits by Jon E. Schoenfield, Mar 28 2014

A008727 Molien series for 3-dimensional group [2,n] = *22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 141, 147, 153, 159, 165, 171, 177, 183, 189, 196, 203, 210, 217, 224, 231, 238, 245, 252

Offset: 0

N. J. A. Sloane

Number of partitions of n into two kinds of 1's and one kind of 9. - Joerg Arndt, Dec 27 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 192
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,0,1,-2,1).

Cf. A001840, A001972, A008724, A008725, A008726, A008732. - Vladimir Joseph Stephan Orlovsky, Mar 14 2010

a:=[1,2,3,4,5,6,7,8,9,11,13];; for n in [12..70] do a[n]:=2*a[n-1]-a[n-2]+a[n-9]-2*a[n-10]+a[n-11]; od; a; # G. C. Greubel, Sep 09 2019

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^9)) )); // G. C. Greubel, Sep 09 2019

seq(coeff(series(1/((1-x)^2*(1-x^9)), x, n+1), x, n), n = 0..70); # G. C. Greubel, Sep 09 2019

Drop[Accumulate[Floor[Range[70]/9]], 8] (* Jean-François Alcover, Mar 27 2013 *)
CoefficientList[Series[1/(1-x)^2/(1-x^9), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)
LinearRecurrence[{2,-1,0,0,0,0,0,0,1,-2,1},{1,2,3,4,5,6,7,8,9,11,13},120] (* Harvey P. Dale, Feb 13 2022 *)

Vec(1/(1-x)^2/(1-x^9)+O(x^66)) /* Joerg Arndt, Mar 27 2013 */

def A008727_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(1/((1-x)^2*(1-x^9))).list()
A008727_list(70) # G. C. Greubel, Sep 09 2019

G.f.: 1/((1-x)^2*(1-x^9)).
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+9} floor(j/9).
a(n-9) = (1/2)*floor(n/9)*(2*n - 7 - 9*floor(n/9)). (End)

A008729 Molien series for 3-dimensional group [2, n] = *22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 78, 82, 86, 90, 94, 98, 102, 106, 110, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 171, 177, 183, 189, 195, 201, 207, 213, 219

Offset: 0

N. J. A. Sloane

			..1....2....3....4....5....6....7....8....9...10...11
.13...15...17...19...21...23...25...27...29...31...33
.36...39...42...45...48...51...54...57...60...63...66
.70...74...78...82...86...90...94...98..102..106..110
115..120..125..130..135..140..145..150..155..160..165
171..177..183..189..195..201..207..213..219..225..231
238..245..252..259..266..273..280..287..294..301..308
316..324..332..340..348..356..364..372..380..388..396
405..414..423..432..441..450..459..468..477..486..495
505..515..525..535..545..555..565..575..585..595..605
...
The first six columns are A051865, A180223, A022268, A022269, A211013, A152740.
- _Philippe Deléham_, Apr 03 2013

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 194
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,0,0,0,1,-2,1).

Cf. A001840, A001972, A008724-A008728, A008732, A218530.

a:=[1,2,3,4,5,6,7,8,9,10,11,13,15];; for n in [14..70] do a[n]:=2*a[n-1]-a[n-2]+a[n-11]-2*a[n-12]+a[n-13]; od; a; # G. C. Greubel, Jul 30 2019

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^11)) )); // G. C. Greubel, Jul 30 2019

g:= 1/((1-x)^2*(1-x^11)); gser:= series(g, x=0,72); seq(coeff(gser, x, n), n=0..70); # modified by G. C. Greubel, Jul 30 2019

CoefficientList[Series[1/((1-x)^2*(1-x^11)), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)

my(x='x+O('x^70)); Vec(1/((1-x)^2*(1-x^11))) \\ G. C. Greubel, Jul 30 2019

(1/((1-x)^2*(1-x^11))).series(x, 70).coefficients(x, sparse=False) # G. C. Greubel, Jul 30 2019

From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+11} floor(j/11).
a(n-11) = (1/2)*floor(n/11)*(2*n - 9 - 11*floor(n/11)). (End)
a(n) = A218530(n+11). - Philippe Deléham, Apr 03 2013
From Chai Wah Wu, Jul 08 2016: (Start)
a(n) = 2*a(n-1) - a(n-2) + a(n-11) - 2*a(n-12) + a(n-13) for n > 12.
G.f.: 1/(1 - 2*x + x^2 - x^11 + 2*x^12 - x^13) = 1/((1-x)^3 *(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10)). (End)

More terms from Vladimir Joseph Stephan Orlovsky, Mar 14 2010

A349841 Triangle T(n,k) built by placing all ones on the left edge, [1,0,0,0,0] repeated on the right edge, and filling the body using the Pascal recurrence T(n,k) = T(n-1,k) + T(n-1,k-1).

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 3, 1, 0, 1, 4, 6, 4, 1, 1, 1, 5, 10, 10, 5, 2, 0, 1, 6, 15, 20, 15, 7, 2, 0, 1, 7, 21, 35, 35, 22, 9, 2, 0, 1, 8, 28, 56, 70, 57, 31, 11, 2, 0, 1, 9, 36, 84, 126, 127, 88, 42, 13, 2, 1

Offset: 0

Michael A. Allen, Dec 13 2021

This is the m=5 member in the sequence of triangles A007318, A059259, A118923, A349839, A349841 which have all ones on the left side, ones separated by m-1 zeros on the other side, and whose interiors obey Pascal's recurrence.
T(n,k) is the (n,n-k)-th entry of the (1/(1-x^5),x/(1-x)) Riordan array.
For n>0, T(n,n-1) = A002266(n+4).
For n>1, T(n,n-2) = A008732(n-2).
For n>2, T(n,n-3) = A122047(n-1).
Sums of rows give A349842.
Sums of antidiagonals give A349843.

			Triangle begins:
  1;
  1,   0;
  1,   1,   0;
  1,   2,   1,   0;
  1,   3,   3,   1,   0;
  1,   4,   6,   4,   1,   1;
  1,   5,  10,  10,   5,   2,   0;
  1,   6,  15,  20,  15,   7,   2,   0;
  1,   7,  21,  35,  35,  22,   9,   2,   0;
  1,   8,  28,  56,  70,  57,  31,  11,   2,   0;
  1,   9,  36,  84, 126, 127,  88,  42,  13,   2,   1;

Michael A. Allen and Kenneth Edwards, On Two Families of Generalizations of Pascal's Triangle, J. Int. Seq. 25 (2022) Article 22.7.1.

Other members of sequence of triangles: A007318, A059259, A118923, A349839.
Columns: A000012, A001477, A000217, A000292, A000332, A323228.
Diagonals: A079998, A002266, A008732, A122047.

Flatten[Table[CoefficientList[Series[(1 - x*y)/((1 - (x*y)^5)(1 - x - x*y)), {x, 0, 20}, {y, 0, 10}], {x, y}][[n+1,k+1]],{n,0,10},{k,0,n}]]

G.f.: (1-x*y)/((1-(x*y)^5)(1-x-x*y)) in the sense that T(n,k) is the coefficient of x^n*y^k in the series expansion of the g.f.
T(n,0) = 1.
T(n,n) = delta(n mod 5,0).
T(n,1) = n-1 for n>0.
T(n,2) = (n-1)*(n-2)/2 for n>1.
T(n,3) = (n-1)*(n-2)*(n-3)/6 for n>2.
T(n,4) = (n-1)*(n-2)*(n-3)*(n-4)/24 for n>3.
T(n,5) = C(n-1,5) + 1 for n>4.
T(n,6) = C(n-1,6) + n - 6 for n>5.
For 0 <= k < n, T(n,k) = (n-k)*Sum_{j=0..floor(k/5)} binomial(n-5*j,n-k)/(n-5*j).
The g.f. of the n-th subdiagonal is 1/((1-x^5)(1-x)^n).

A008730 Molien series 1/((1-x)^2(1-x^12)) for 3-dimensional group [2,n] = 22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 186, 192, 198, 204

Offset: 0

N. J. A. Sloane

			..1....2....3....4....5....6....7....8....9...10...11...12
.14...16...18...20...22...24...26...28...30...32...34...36
.39...42...45...48...51...54...57...60...63...66...69...72
.76...80...84...88...92...96..100..104..108..112..116..120
125..130..135..140..145..150..155..160..165..170..175..180
186..192..198..204..210..216..222..228..234..240..246..252
259..266..273..280..287..294..301..308..315..322..329..336
344..352..360..368..376..384..392..400..408..416..424..432
441..450..459..468..477..486..495..504..513..522..531..540
550..560..570..580..590..600..610..620..630..640..650..660
...
The columns are: A051866, A139267, A094159, A033579, A049452, A033581, A049453, A033580, A195319, A202804, A211014, A049598
- _Philippe Deléham_, Apr 03 2013

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 195
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 1).

Cf. A001840, A001972, A008724, A008725, A008726, A008727, A008728, A008729, A008732. - Vladimir Joseph Stephan Orlovsky, Mar 14 2010

Cf. A221912

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^12)) )); // G. C. Greubel, Jul 30 2019

seq(coeff(series(1/(1-x)^2/(1-x^12), x, n+1), x, n), n=0..80);

CoefficientList[Series[1/((1-x)^2*(1-x^12)), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)
LinearRecurrence[{2,-1,0,0,0,0,0,0,0,0,0,1,-2,1},{1,2,3,4,5,6,7,8,9,10,11,12,14,16},70] (* Harvey P. Dale, Jan 01 2024 *)

my(x='x+O('x^70)); Vec(1/((1-x)^2*(1-x^12))) \\ G. C. Greubel, Jul 30 2019

(1/((1-x)^2*(1-x^12))).series(x, 70).coefficients(x, sparse=False) # G. C. Greubel, Jul 30 2019

G.f. 1/( (1-x)^3 * (1+x) *(1+x+x^2) *(1-x+x^2) * (1+x^2) *(1-x^2+x^4)). - R. J. Mathar, Aug 11 2021
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+12} floor(j/12).
a(n-12) = (1/2)*floor(n/12)*(2*n - 10 - 12*floor(n/12)). (End)
a(n) = A221912(n+12). - Philippe Deléham, Apr 03 2013

More terms from Vladimir Joseph Stephan Orlovsky, Mar 14 2010

A238738 Expansion of (1 + 2x + 2x^2)/(1 - x - 2x^3 + 2x^4 + x^6 - x^7).

Original entry on oeis.org

1, 3, 5, 7, 11, 15, 18, 24, 30, 34, 42, 50, 55, 65, 75, 81, 93, 105, 112, 126, 140, 148, 164, 180, 189, 207, 225, 235, 255, 275, 286, 308, 330, 342, 366, 390, 403, 429, 455, 469, 497, 525, 540, 570, 600, 616, 648, 680, 697, 731, 765, 783, 819, 855, 874

Offset: 0

Bruno Berselli, Mar 04 2014

Subsequence of A008732: a(n) = A008732(A047212(n+1)).

See also Deléham's example in A008732: these numbers are in the first (A000566), third (A005475) and fifth (A028895) column.

			G.f.: 1 + 3*x + 5*x^2 + 7*x^3 + 11*x^4 + 15*x^5 + 18*x^6 + 24*x^7 + ...

Bruno Berselli, Table of n, a(n) for n = 0..1000
Bruno Berselli, Illustration of the initial terms.
Index entries for linear recurrences with constant coefficients, signature (1,0,2,-2,0,-1,1).

Cf. A000212 (see illustration above), A000217, A008732, A211538.

m:=60; R:=PowerSeriesRing(Integers(), m); Coefficients(R!((1+2*x+2*x^2)/(1-x-2*x^3+2*x^4+x^6-x^7)));

CoefficientList[Series[(1 + 2 x + 2 x^2)/(1 - x - 2 x^3 + 2 x^4 + x^6 - x^7), {x, 0, 60}], x]

makelist(coeff(taylor((1+2*x+2*x^2)/(1-x-2*x^3+2*x^4+x^6-x^7), x, 0, n), x, n), n, 0, 60);

Vec((1+2*x+2*x^2)/(1-x-2*x^3+2*x^4+x^6-x^7)+O(x^60))

m = 60; L. = PowerSeriesRing(ZZ, m); f = (1+2*x+2*x^2)/(1-x-2*x^3+2*x^4+x^6-x^7); print(f.coefficients())

G.f.: (1 + 2*x + 2*x^2) / ((1 - x)^3*(1 + x + x^2)^2).
a(n) = a(n-1) + 2*a(n-3) - 2*a(n-4) - a(n-6) + a(n-7), with n>6.
a(3k)   = k*(5*k +  7)/2 + 1 (A000566);
a(3k+1) = k*(5*k + 11)/2 + 3 (A005475);
a(3k+2) = k*(5*k + 15)/2 + 5 (A028895).
a(n) = (floor(n/3)+1)*(4*n-7*floor(n/3)+2)/2. [Luce ETIENNE, Jun 14 2014]

cp's OEIS Frontend

A130520 a(n) = Sum_{k=0..n} floor(k/5). (Partial sums of A002266.)

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A118015 a(n) = floor(n^2/5).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Sage

Formula

Extensions

A008728 Molien series for 3-dimensional group [2,n ] = *22n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A008726 Molien series 1/((1-x)^2*(1-x^8)) for 3-dimensional group [2,n] = *22n.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A008727 Molien series for 3-dimensional group [2,n] = *22n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A008729 Molien series for 3-dimensional group [2, n] = *22n.

Views

Author

A008726 Molien series 1/((1-x)^2(1-x^8)) for 3-dimensional group [2,n] = 22n.

A008730 Molien series 1/((1-x)^2(1-x^12)) for 3-dimensional group [2,n] = 22n.

A238738 Expansion of (1 + 2x + 2x^2)/(1 - x - 2x^3 + 2x^4 + x^6 - x^7).