A144677 -id:A144677 - cp's OEIS frontend

A159797 Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n-1.

0, 1, 1, 2, 3, 4, 3, 5, 7, 9, 4, 7, 10, 13, 16, 5, 9, 13, 17, 21, 25, 6, 11, 16, 21, 26, 31, 36, 7, 13, 19, 25, 31, 37, 43, 49, 8, 15, 22, 29, 36, 43, 50, 57, 64, 9, 17, 25, 33, 41, 49, 57, 65, 73, 81, 10, 19, 28, 37, 46, 55, 64, 73, 82, 91, 100, 11, 21, 31, 41, 51, 61, 71, 81, 91, 101

Offset: 0

Omar E. Pol, Jul 09 2009

Note that the last term of the n-th row is the n-th square A000290(n).
See also A162611, A162614 and A162622.
The triangle sums, see A180662 for their definitions, link the triangle A159797 with eleven sequences, see the crossrefs. - Johannes W. Meijer, May 20 2011
T(n,k) is the number of distinct sums in the direct sum of {1, 2, ... n} with itself k times for 1 <= k <= n+1, e.g., T(5,3) = the number of distinct sums in the direct sum {1,2,3,4,5} + {1,2,3,4,5} + {1,2,3,4,5}. The sums range from 1+1+1=3 to 5+5+5=15. So there are 13 distinct sums. - Derek Orr, Nov 26 2014

			Triangle begins:
0;
1, 1;
2, 3, 4;
3, 5, 7, 9;
4, 7,10,13,16;
5, 9,13,17,21,25;
6,11,16,21,26,31,36;

Harvey P. Dale, Table of n, a(n) for n = 0..1000
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A000290, A001477, A081493, A159798, A162609, A162610, A162611, A162614, A162622.
Cf.: A006002 (row sums). - R. J. Mathar, Jul 17 2009
Cf. A163282, A163283, A163284, A163285. - Omar E. Pol, Nov 18 2009
From Johannes W. Meijer, May 20 2011: (Start)
Triangle sums (see the comments): A006002 (Row1), A050187 (Row2), A058187 (Related to Kn11, Kn12, Kn13, Fi1 and Ze1), A006918 (Related to Kn21, Kn22, Kn23, Fi2 and Ze2), A000330 (Kn3), A016061 (Kn4), A190717 (Related to Ca1 and Ze3), A144677 (Related to Ca2 and Ze4), A000292 (Related to Ca3, Ca4, Gi3 and Gi4) A190718 (Related to Gi1) and A144678 (Related to Gi2). (End)

A159797:=proc(n) local m: m := floor( (sqrt(8*n+1)-1)/2 ): A159797(n):= m + (n - m*(m+1)/2)*(m-1) end: seq(A159797(n),n=0..75); # Johannes W. Meijer, May 20 2011

Flatten[Table[NestList[#+n-1&,n,n],{n,0,12}]] (* Harvey P. Dale, Aug 04 2014 *)

Given m = floor( (sqrt(8*n+1)-1)/2 ), then a(n) = m + (n - m*(m+1)/2)*(m-1). - Carl R. White, Jul 24 2010

Edited by Omar E. Pol, Jul 18 2009
More terms from Omar E. Pol, Nov 18 2009
More terms from Carl R. White, Jul 24 2010

A014125 Bisection of A001400.

Original entry on oeis.org

1, 3, 6, 11, 18, 27, 39, 54, 72, 94, 120, 150, 185, 225, 270, 321, 378, 441, 511, 588, 672, 764, 864, 972, 1089, 1215, 1350, 1495, 1650, 1815, 1991, 2178, 2376, 2586, 2808, 3042, 3289, 3549, 3822, 4109, 4410, 4725, 5055, 5400, 5760, 6136, 6528, 6936, 7361, 7803

Offset: 0

N. J. A. Sloane

Also Schoenheim bound L_1(n,5,4).
Degrees of polynomials defined by p(n) = (x^(n+1)*p(n-1)p(n-3) + p(n-2)^2)/p(n-4), p(-4)=p(-3)=p(-2)=p(-1)=1. - Michael Somos, Jul 21 2004
Degrees of polynomial tau-functions of q-discrete Painlevé I, which generate sequence A095708 when q=2 (up to an offset of 3). - Andrew Hone, Jul 29 2004
Because of the Laurent phenomenon for the general q-discrete Painlevé I tau-function recurrence p(n) = (a*x^(n+1)*p(n-1)*p(n-3) + b*p(n-2)^2)/p(n-4), p(n) for n > -1 will always be a polynomial in x and a Laurent polynomial in a,b and the initial data p(-4),p(-3),p(-2),p(-1). - Andrew Hone, Jul 29 2004
Create the sequence 0,0,0,0,0,6,18,36,66,108,... so that the sum of three consecutive terms b(n) + b(n+1) + b(n+2) = A007531(n), with b(0)=0; then a(n) = b(n+5)/6. - J. M. Bergot, Jul 30 2013
Number of partitions of n into three kinds of part 1 and one kind of part 3. - Joerg Arndt, Sep 28 2015
First differences are A001840(k) starting with k=2; second differences are A086161(k) starting with k=1. - Bob Selcoe, Sep 28 2015
Maximum Wiener index of all maximal planar graphs with n+2 vertices.  The extremal graphs are cubes of paths. - Allan Bickle, Jul 09 2022
Maximum Wiener index of all maximal 3-degenerate graphs with n+2 vertices.  (A maximal 3-degenerate graph can be constructed from a 3-clique by iteratively adding a new 3-leaf (vertex of degree 3) adjacent to three existing vertices.)  The extremal graphs are cubes of paths, so the bound also applies to 3-trees. - Allan Bickle, Sep 18 2022

			Polynomials: p(0)=x+1, p(1)=x^3+x^2+1, p(2)=x^6+x^5+x^3+x^2+2x+1, ...
a(12)=185:  A000217(13)=91 + a(9)=94 == 91+55+28+10+1 = 185. - _Bob Selcoe_, Sep 27 2015
a(3)=11: the 11 partitions of 3 are {1a,1a,1a}, {1a,1a,1b}, {1a,1a,1c}, {1a,1b,1b}, {1a,1b,1c}, {1a,1c,1c}, {1b,1b,1b}, {1b,1b,1c}, {1b,1c,1c}, {1c,1c,1c}, {3}. - _Bob Selcoe_, Oct 04 2015

W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of Jeffrey H. Dinitz and D. R. Stinson, editors, Contemporary Design Theory, Wiley, 1992. See Eq. 1.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
L. Smiley, Hidden Hexagons (preprint).

Michael De Vlieger, Table of n, a(n) for n = 0..10000
Joshua Alman, Cesar Cuenca, and Jiaoyang Huang, Laurent phenomenon sequences, Journal of Algebraic Combinatorics 43(3) (2015), 589-633.
Allan Bickle and Zhongyuan Che, Wiener indices of maximal k-degenerate graphs, arXiv:1908.09202 [math.CO], 2019.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
Z. Che and K. L. Collins, An upper bound on Wiener indices of maximal planar graphs, Discrete Appl. Math. 258 (2019), 76-86.
Éva Czabarka, Peter Dankelmann, Trevor Olsen, and László A. Székely, Wiener Index and Remoteness in Triangulations and Quadrangulations, arXiv:1905.06753 [math.CO], 2019.
S. Fomin and A. Zelevinsky, The Laurent Phenomenon, Advances in Applied Mathematics, 28 (2002), 119-144.
D. Ghosh, E. Győri, A. Paulos, N. Salia, and O. Zamora, The maximum Wiener index of maximal planar graphs, Journal of Combinatorial Optimization 40, (2020), 1121-1135.
H. R. Henze and C. M. Blair, The number of structurally isomeric hydrocarbons of the ethylene series, J. Amer. Chem. Soc., 55 (1933), 680-685.
H. R. Henze and C. M. Blair, The number of structurally isomeric Hydrocarbons of the Ethylene Series, J. Amer. Chem. Soc., 55 (2) (1933), 680-685. (Annotated scanned copy)
A. N. W. Hone, Algebraic curves, integer sequences and a discrete Painlevé transcendent, arXiv:0807.2538 [nlin.SI], 2008; Proceedings of SIDE 6, Helsinki, Finland, 2004. [Set a(n)=d(n+3) on p. 8]
Brian O'Sullivan and Thomas Busch, Spontaneous emission in ultra-cold spin-polarised anisotropic Fermi seas, arXiv 0810.0231v1 [quant-ph], 2008. [Eq 10a, lambda=3]
Index entries for two-way infinite sequences
Index entries for covering numbers
Index entries for linear recurrences with constant coefficients, signature (3,-3,2,-3,3,-1).

Cf. A000217, A000631, A001840, A014126, A086161, A095708.
A column of A036838.
Cf. A002623, A014125, A122046, A122047. - Johannes W. Meijer, May 20 2011
Maximum Wiener index of all maximal k-degenerate graphs for k=1..6: A000292, A002623, A014125, A122046, A122047, A175724.

[n^3/18+n^2/2+4*n/3+1+(((n+1) mod 3)-1)/9 : n in [0..50]]; // Wesley Ivan Hurt, Apr 14 2015

I:=[1,3,6,11,18,27]; [n le 6 select I[n] else 3*Self(n-1) -3*Self(n-2) +2*Self(n-3)-3*Self(n-4)+3*Self(n-5)-Self(n-6): n in [1..50]]; // Vincenzo Librandi, Apr 15 2015

L := proc(v,k,t,l) local i,t1; t1 := l; for i from v-t+1 to v do t1 := ceil(t1*i/(i-(v-k))); od: t1; end; # gives Schoenheim bound L_l(v,k,t). Current sequence is L_1(n,n-3,n-4,1).

CoefficientList[Series[1/((1 - x)^3*(1 - x^3)), {x, 0, 50}], x] (* Wesley Ivan Hurt, Apr 14 2015 *)

a(n)=if(n<-5,-a(-6-n),polcoeff(1/(1-x)^3/(1-x^3)+x^n*O(x),n)) /* Michael Somos, Jul 21 2004 */

my(x='x+O('x^50)); Vec(1/((1-x)^3*(1-x^3))) \\ Altug Alkan, Oct 16 2015

a(n)=(n^3 + 9*n^2 + 24*n + 19)\/18 \\ Charles R Greathouse IV, Jun 29 2020

[(binomial(n+4,3) - ((n+4)//3))/3 for n in (0..50)] # G. C. Greubel, Apr 28 2019

G.f.: 1/((1-x)^3*(1-x^3)).
a(n) = -a(-6-n) = 3*a(n-1) -3*a(n-2) +2*a(n-3) -3*a(n-4) +3*a(n-5) -a(n-6).
The simplest recurrence is fourth order: a(n) = a(n-1) + a(n-3) - a(n-4) + n + 1, which gives the g.f.: 1/((1-x)^3*(1-x^3)), with a(-4) = a(-3) = a(-2) = a(-1) = 0.
a(n) = n^3/18 + n^2/2 + 4*n/3 + 1 + 2/(9*sqrt(3))*sin(2*Pi*n/3). - Andrew Hone, Jul 29 2004
a(n) = n^3/18 + n^2/2 + 4*n/3 + 1 + (((n+1) mod 3) - 1)/9. - same formula, simplified by Gerald Hillier, Apr 14 2015
a(n) = (2*A000027(n+1) + 3*A000292(n+1) + A049347(n-1) + 1 + 3*A000217(n+1))/9. - R. J. Mathar, Nov 16 2007
From Johannes W. Meijer, May 20 2011: (Start)
a(n) = A144677(n) + A144677(n-1) + A144677(n-2).
a(n) = A190717(n-4) + 2*A190717(n-3) + 3*A190717(n-2) + 2*A190717(n-1) + A190717(n). (End)
3*a(n) = binomial(n+4,3) - floor((n+4)/3). - Bruno Berselli, Nov 08 2013
a(n) = A000217(n+1) + a(n-3) = Sum_{j>=0, n>=3*j} (n-3*j+1)*(n-3*j+2)/2. - Bob Selcoe, Sep 27 2015
a(n) = round(((2*n+5)^3 + 3*(2*n+5)^2 - 9*(2*n+5))/144). - Giacomo Guglieri, Jun 28 2020
a(n) = floor(((n+2)^3 + 3*(n+2)^2)/18). - Allan Bickle, Aug 01 2020
a(n) = Sum_{j=0..n} (n-j+1)*floor((j+3)/3). - G. C. Greubel, Oct 18 2021
E.g.f.: exp(x) + exp(x)*x*(34 + 12*x + x^2)/18 + 2*exp(-x/2)*sin(sqrt(3)*x/2)/(9*sqrt(3)). - Stefano Spezia, Apr 05 2023

More terms from James Sellers, Dec 24 1999

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

Original entry on oeis.org

1, 2, 4, 8, 12, 18, 27, 36, 48, 64, 80, 100, 125, 150, 180, 216, 252, 294, 343, 392, 448, 512, 576, 648, 729, 810, 900, 1000, 1100, 1210, 1331, 1452, 1584, 1728, 1872, 2028, 2197, 2366, 2548, 2744, 2940, 3150, 3375, 3600, 3840, 4096, 4352, 4624, 4913, 5202

Offset: 0

N. J. A. Sloane

a(n+3) = maximal product of three numbers with sum n: a(n) = max(r*s*t), n = r+s+t. - Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jul 10 2003
It appears that k is a term of the sequence if and only if k is a positive integer such that floor(v) * ceiling(v) * round(v) = k, where v = k^(1/3). - John W. Layman, Mar 21 2012
The sequence floor(n/3)*floor((n+1)/3)*floor((n+2)/3) is essentially the same: 0, 0, 0, 1, 2, 4, 8, 12, 18, 27, 36, 48, 64, 80, 100, 125, 150, 180, 216, 252, ... - N. J. A. Sloane, Dec 27 2013

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
G. E. Bergum and V. E. Hoggatt, Jr., A combinatorial problem involving recursive sequences and tridiagonal matrices, Fib. Quart., 16 (1978), 113-118.
Dhruv Mubayi, Counting substructures II: Hypergraphs, Combinatorica 33 (2013), no. 5, 591--612. MR3132928.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
Index entries for linear recurrences with constant coefficients, signature (2,-1,2,-4,2,-1,2,-1).

Cf. A000578, A002117, A144677, A210433.

Maximal product of k positive integers with sum n, for k = 2..10: A002620 (k=2), this sequence (k=3), A008233 (k=4), A008382 (k=5), A008881 (k=6), A009641 (k=7), A009694 (k=8), A009714 (k=9), A354600 (k=10).

A006501:=(1+z**2)/(z**2+z+1)**2/(z-1)**4; # Simon Plouffe in his 1992 dissertation

CoefficientList[Series[(1+x^2)/(1-x)^2 /(1-x^3)^2,{x,0,50}],x] (* Vincenzo Librandi, Jun 16 2012 *)

a(n) = [(n+3)/3] * [(n+4)/3] * [(n+5)/3]. - Reinhard Zumkeller, May 18 2004
a(n-3) = Sum_{k=0..n} [k/3]*[(k+1)/3]. - Mitch Harris, Dec 02 2004
Conjecture: a(n) = A144677(n) + A144677(n-2). - R. J. Mathar, Mar 15 2011
Sum_{n>=0} 1/a(n) = 1 + zeta(3). - Amiram Eldar, Jan 10 2023
a(3*m) = (m+1)^3 (A000578). - Bernard Schott, Feb 22 2023

More terms from Reinhard Zumkeller, May 18 2004

A190717 Triplicated tetrahedral numbers A000292.

Original entry on oeis.org

1, 1, 1, 4, 4, 4, 10, 10, 10, 20, 20, 20, 35, 35, 35, 56, 56, 56, 84, 84, 84, 120, 120, 120, 165, 165, 165, 220, 220, 220, 286, 286, 286, 364, 364, 364, 455, 455, 455, 560, 560, 560, 680, 680, 680, 816, 816, 816, 969, 969, 969

Offset: 0

Johannes W. Meijer, May 18 2011

The Ca1 and Ze3 triangle sums, see A180662 for their definitions, of the triangle A159797 are linear sums of shifted versions of the triplicated tetrahedral numbers, e.g. Ca1(n) = a(n-1) + a(n-2) + 2*a(n-3) + a(n-6).

The Ca1, Ca2, Ze3 and Ze4 triangle sums of the Connell sequence A001614 as a triangle are also linear sums of shifted versions of the sequence given above.

Index entries for linear recurrences with constant coefficients, signature (1,0,3,-3,0,-3,3,0,1,-1).

Cf. A000292 (tetrahedral numbers), A058187 (duplicated), this sequence (triplicated), A190718 (quadruplicated), A049347, A144677.

A190717:= proc(n) option remember; A190717(n):= binomial(floor(n/3)+3,3) end: seq(A190717(n),n=0..50);

LinearRecurrence[{1,0,3,-3,0,-3,3,0,1,-1},{1,1,1,4,4,4,10,10,10,20},60] (* Harvey P. Dale, Mar 09 2018 *)

a(n) = binomial(floor(n/3)+3,3).
a(n) + a(n-1) + a(n-2) = A144677(n).
a(n) = Sum_{k=0..n} (A144677(n-k)*A049347(k)).
G.f.: 1/((x-1)^4*(x^2+x+1)^3).
Sum_{n>=0} 1/a(n) = 9/2. - Amiram Eldar, Aug 18 2022

A144678 Related to enumeration of quantum states (see reference for precise definition).

Original entry on oeis.org

1, 2, 3, 4, 7, 10, 13, 16, 22, 28, 34, 40, 50, 60, 70, 80, 95, 110, 125, 140, 161, 182, 203, 224, 252, 280, 308, 336, 372, 408, 444, 480, 525, 570, 615, 660, 715, 770, 825, 880, 946, 1012, 1078, 1144, 1222, 1300, 1378, 1456, 1547, 1638, 1729, 1820, 1925, 2030, 2135

Offset: 0

N. J. A. Sloane, Feb 06 2009

The Gi2 triangle sums of the triangle A159797 are linear sums of shifted versions of the sequence given above, i.e., Gi2(n) = a(n-1) + 2*a(n-2) + 2*a(n-3) + 3*a(n-4) + a(n-5). For the definitions of the Gi2 and other triangle sums see A180662. [Johannes W. Meijer, May 20 2011]
Partial sums of 1,1,1,1, 3,3,3,3, 6,6,6,6,..., the quadruplicated A000217. - R. J. Mathar, Aug 25 2013
Number of partitions of n into two different parts of size 4 and two different parts of size 1. a(4) = 7: 4, 4', 1111, 1111', 111'1', 11'1'1', 1'1'1'1'. - Alois P. Heinz, Dec 22 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000
Brian O'Sullivan and Thomas Busch, Spontaneous emission in ultra-cold spin-polarised anisotropic Fermi seas, arXiv 0810.0231v1 [quant-ph], 2008. [Eq 10b, lambda=4]
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,2,-4,2,0,-1,2,-1).

Cf. A000292, A006918, A144677, A144679, A190718.

R:=PowerSeriesRing(Integers(), 60); Coefficients(R!( 1/((1-x)*(1-x^4))^2 )); // G. C. Greubel, Oct 18 2021

n:=80; lambda:=4; S10b:=[];
for ii from 0 to n do
x:=floor(ii/lambda);
snc:=1/6*(x+1)*(x+2)*(3*ii-2*x*lambda+3);
S10b:=[op(S10b),snc];
od:
S10b;
A144678 := proc(n) option remember;
   local k;
   sum(A190718(n-k),k=0..3)
end:
A190718:= proc(n)
   binomial(floor(n/4)+3,3)
end:
seq(A144678(n),n=0..54); # Johannes W. Meijer, May 20 2011

a[n_] = (r = Mod[n, 4]; (4+n-r)(8+n-r)(3+n+2r)/96); Table[a[n], {n, 0, 54}] (* Jean-François Alcover, Sep 02 2011 *)
LinearRecurrence[{2,-1,0,2,-4,2,0,-1,2,-1}, {1,2,3,4,7,10,13,16,22,28}, 60] (* G. C. Greubel, Oct 18 2021 *)

Vec(1/(x-1)^4/(x^3+x^2+x+1)^2+O(x^99)) \\ Charles R Greathouse IV, Jun 20 2013

def A144678_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( 1/((1-x)*(1-x^4))^2 ).list()
A144678_list(60) # G. C. Greubel, Oct 18 2021

From Johannes W. Meijer, May 20 2011: (Start)
a(n) = A190718(n-3) + A190718(n-2) + A190718(n-1) + A190718(n).
a(n-3) + a(n-2) + a(n-1) + a(n) = A122046(n+3).
G.f.: 1/((x-1)^4*(x^3+x^2+x+1)^2). (End)
a(n) = A009531(n+5)/16 + (n+5)*(2*n^2+20*n+33+3*(-1)^n)/192 . - R. J. Mathar, Jun 20 2013
a(n) = Sum_{i=1..n+8} floor(i/4) * floor((n+8-i)/4). - Wesley Ivan Hurt, Jul 21 2014
From Alois P. Heinz, Dec 22 2021: (Start)
G.f.: 1/((1-x)*(1-x^4))^2.
a(n) = Sum_{j=0..floor(n/4)} (j+1)*(n-4*j+1). (End)

A144679 a(n) = [n/5 + 1][n/5 + 2](3n - 10[n/5] + 3)/6, where [.] = floor.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 11, 14, 17, 20, 26, 32, 38, 44, 50, 60, 70, 80, 90, 100, 115, 130, 145, 160, 175, 196, 217, 238, 259, 280, 308, 336, 364, 392, 420, 456, 492, 528, 564, 600, 645, 690, 735, 780, 825, 880, 935, 990, 1045, 1100, 1166, 1232, 1298, 1364, 1430, 1508, 1586, 1664

Offset: 0

N. J. A. Sloane, Feb 06 2009

Related to enumeration of quantum states: this is S_c defined in eq.(10b) of the O'Sullivan and Busch reference, with lambda = 5.

This coincides with the formula for an upper bound on the minimum number of monochromatic triangles in the complete graph K_{n+11} with 3-colored edges given by Cummings et al. (2013) in Corollary 3. (The paper claims that this bound is sharp only for all sufficiently large n.) - M. F. Hasler, Jun 25 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000
James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, and Michael Young, Monochromatic triangles in three-coloured graphs, Journal of Combinatorial Theory B 103 no. 4 (2013) 489-503 (also: arXiv:1206.1987).
Brian O'Sullivan and Thomas Busch, Spontaneous emission in ultra-cold spin-polarised anisotropic Fermi seas, arXiv 0810.0231v1 [quant-ph], 2008. [Eq (10b), lambda=5]
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,2,-4,2,0,0,-1,2,-1).

Cf. A000292, A006918, A122047, A144678, A144677.

R:=PowerSeriesRing(Integers(), 60); Coefficients(R!( 1/((1-x)*(1-x^5))^2 )); // G. C. Greubel, Oct 18 2021

n:=80; lambda:=5; S10b:=[];
for ii from 0 to n do
x:=floor(ii/lambda);
snc:=1/6*(x+1)*(x+2)*(3*ii-2*x*lambda+3);
S10b:=[op(S10b),snc];
od:
S10b;
A144679 := proc(n) option remember; local k; sum(THN5(n-k),k=0..4) end: THN5:= proc(n) option remember; THN5(n):= binomial(floor(n/5)+3,3) end: seq(A144679(n), n=0..57); # Johannes W. Meijer, May 20 2011

LinearRecurrence[{2,-1,0,0,2,-4,2,0,0,-1,2,-1}, {1,2,3,4,5,8,11,14,17,20,26,32}, 60] (* Jean-François Alcover, Nov 22 2017 *)
CoefficientList[Series[1/((x-1)^4(x^4+x^3+x^2+x+1)^2),{x,0,100}],x] (* Harvey P. Dale, Aug 29 2021 *)

apply( {A144679(n)=(3*n+3-10*n\=5)*(n+1)*(n+2)\6}, [0..55]) \\ M. F. Hasler, Jun 25 2021

def A144679_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( 1/((1-x)*(1-x^5))^2 ).list()
A144679_list(60) # G. C. Greubel, Oct 18 2021

From Johannes W. Meijer, May 20 2011: (Start)
a(n-4) + a(n-3) + a(n-2) + a(n-1) + a(n) = A122047(n+2).
G.f.: 1/((1-x)^4*(1 + x + x^2 + x^3 + x^4)^2). (End)
a(n) = r*A000292(q+1) + (5-r)*A000292(q) = (n + 2r + 1)*(q + 2)*(q + 1)/6, where A000292(q) = binomial(q+2,3), r = (n+1) mod 5, q = (n+1-r)/5. - M. F. Hasler, Jun 25 2021

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

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 2, 4, 2, 2, 6, 2, 3, 7, 3, 3, 9, 3, 4, 10, 4, 4, 12, 4, 5, 13, 5, 5, 15, 5, 6, 16, 6, 6, 18, 6, 7, 19, 7, 7, 21, 7, 8, 22, 8, 8, 24, 8, 9, 25, 9, 9, 27, 9, 10, 28, 10, 10, 30, 10, 11, 31, 11, 11, 33, 11, 12, 34, 12, 12, 36

Offset: 0

Paul Barry, Apr 01 2006

Diagonal sums of number triangle A117904.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-1,0,2,2,0,-1,-1).

Cf. A014125, A117904, A144677.

R:=PowerSeriesRing(Integers(), 75); Coefficients(R!( (1+2*x+2*x^2)/((1+x)*(1-x^3)^2) )); // G. C. Greubel, Oct 18 2021

LinearRecurrence[{-1,0,2,2,0,-1,-1}, {1,1,1,1,3,1,2}, 75] (* G. C. Greubel, Oct 10 2021 *)

lista(n) = {my(x = 'x + 'x*O('x^n)); P = (1+2*x+2*x^2) / ((1-x^3)*(1+x-x^3-x^4)); Vec(P);}  \\ Michel Marcus, Mar 20 2013

def A117905_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1+2*x+2*x^2)/((1+x)*(1-x^3)^2) ).list()
A117905_list(75) # G. C. Greubel, Oct 18 2021

a(n) = -a(n-1) + 2*a(n-3) + 2*a(n-4) - a(n-6) - a(n-7).
a(n) = Sum_{k=0..floor(n/2)} 0^abs(L(C(n-k,2)/3) - L(C(k,2)/3)), where L(j/p) is the Legendre symbol of j and p.
From G. C. Greubel, Oct 18 2021: (Start)
a(n) = (1/36)*(10*n + 23 + (-1)^n*(9 + 16*u(n, 1/2) - 4*u(n-1, 1/2) - 12*Sum_{j=0..n} u(n-j, 1/2)*u(j, 1/2))), where u(n, x) = ChebyshevU(n, x).
a(n) = (1/36)*(39 + 30*n + 9*(-1)^n - 48*floor((n+2)/3) - 12*floor((n+1)/3) - 12*b(n)), where b(n) = binomial(n+3, 3) - 6*A014125(n-1) + 9*A144677(n-2). (End)

A117910 Expansion of (1 + x + x^2 + x^4)/((1-x^3)*(1-x^6)).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 2, 3, 2, 2, 4, 2, 3, 5, 3, 3, 6, 3, 4, 7, 4, 4, 8, 4, 5, 9, 5, 5, 10, 5, 6, 11, 6, 6, 12, 6, 7, 13, 7, 7, 14, 7, 8, 15, 8, 8, 16, 8, 9, 17, 9, 9, 18, 9, 10, 19, 10, 10, 20, 10, 11, 21, 11, 11, 22, 11, 12, 23, 12, 12, 24, 12, 13, 25, 13, 13, 26, 13, 14, 27, 14

Offset: 0

Paul Barry, Apr 01 2006

Diagonal sums of A117908.

Appears to be a permutation of floor((n+5)/5).

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (0,0,1,0,0,1,0,0,-1).

Cf. A002264, A014125, A024164, A144677, A117908, A152467, A175676.

R:=PowerSeriesRing(Integers(), 100); Coefficients(R!( (1+x+x^2+x^4)/((1-x^3)*(1-x^6)) )); // G. C. Greubel, Oct 21 2021

CoefficientList[Series[(1+x+x^2+x^4)/((1-x^3)(1-x^6)),{x,0,100}],x] (* or *) LinearRecurrence[{0,0,1,0,0,1,0,0,-1},{1,1,1,1,2,1,2,3,2},100] (* Harvey P. Dale, Apr 10 2014 *)
Table[If[Mod[n,3]==1, Mod[Binomial[n+2,3], n+2], Floor[(n+6)/6]], {n, 0, 100}] (* G. C. Greubel, Nov 18 2021 *)

def A117910_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1+x+x^2+x^4)/((1-x^3)*(1-x^6)) ).list()
A117910_list(100) # G. C. Greubel, Oct 21 2021

a(n) = a(n-3) + a(n-6) - a(n-9).
a(n) = Sum_{k=0..floor(n/2)} 0^abs(L(C(n-k,2)/3) - 2*L(C(k,2)/3)) where L(j/p) is the Legendre symbol of j and p.
From G. C. Greubel, Nov 18 2021: (Start)
a(n) = A152467(n+3) + A152467(n+6) if n == 1 (mod 3), otherwise A152467(n+6).
a(n) = A175676(n+2) if n == 1 (mod 3), otherwise A152467(n+6).
a(n) = A002264(n+3) if n == 1 (mod 3), otherwise A152467(n+6). (End)

A308630 Triangle T(n,k) read by rows: the sum of all smallest parts among all k-compositions of n.

Original entry on oeis.org

1, 2, 2, 3, 2, 3, 4, 6, 6, 4, 5, 6, 9, 12, 5, 6, 12, 18, 24, 20, 6, 7, 12, 27, 40, 50, 30, 7, 8, 20, 36, 68, 100, 90, 42, 8, 9, 20, 54, 108, 175, 210, 147, 56, 9, 10, 30, 72, 160, 290, 420, 392, 224, 72, 10, 11, 30, 90, 224, 460, 756, 882, 672, 324, 90, 11, 12, 42, 120, 312, 700, 1272, 1764, 1680, 1080, 450, 110

Offset: 1

R. J. Mathar, Jun 12 2019

			The triangle starts in row n=1 with columns 1<=k<=n as:
   1;
   2,  2;
   3,  2,  3;
   4,  6,  6,  4;
   5,  6,  9, 12,  5;
   6, 12, 18, 24, 20,  6;
   7, 12, 27, 40, 50, 30,  7;
   8, 20, 36, 68,100, 90, 42,  8;
   9, 20, 54,108,175,210,147, 56,  9;
  10, 30, 72,160,290,420,392,224, 72, 10;
  ...

Knopfmacher, Arnold; Munagi, Augustine O. Smallest parts in compositions, Kotsireas, Ilias S. (ed.) et al., Advances in combinatorics. 3rd Waterloo workshop on computer algebra (WWCA, W80) 2011, Waterloo, Canada, May 26-29, 2011. Berlin: Springer. 197-207 (2013).

Cf. A097941 (number of smallest parts), A002378 (k=2), A144677 (column k=3 divided by 3), A097940 (row sums).

A308630 := proc(n,k)
    add(j*binomial(n-(j-1)*k-2,k-2),j=1..floor(n/k)) ;
    %*k ;
end proc:

T(n,k) = k*sum_{j=1..floor(n/k)} binomial(n-(j-1)*k-2, k-2).

A225566 The set of magic numbers for an idealized harmonic oscillator atomic nucleus with a biaxially deformed prolate ellipsoid shape and an oscillator ratio of 3:1.

Original entry on oeis.org

2, 4, 6, 12, 18, 24, 36, 48, 60, 80, 100, 120, 150, 180, 210, 252, 294, 336, 392, 448, 504, 576, 648, 720, 810, 900, 990, 1100, 1210, 1320, 1452, 1584, 1716, 1872, 2028, 2184, 2366, 2548, 2730, 2940, 3150, 3360, 3600, 3840, 4080, 4352, 4624, 4896, 5202, 5508, 5814, 6156, 6498, 6840, 7220, 7600, 7980, 8400, 8820, 9240, 9702

Offset: 1

Jess Tauber, May 14 2013

Partial sums of series of three doubled triangular numbers of the same value in order: 2,2,2,6,6,6,12,12,12,20,20,20... (cf. A002378).

Harvey P. Dale, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (2,-1,2,-4,2,-1,2,-1).

Equals twice A144677. Cf. A002378.

Accumulate[Flatten[{#,#,#}&/@Accumulate[2*Range[30]]]] (* Harvey P. Dale, May 01 2014 *)

Vec(2*x/((1-x)^4*(1+x+x^2)^2) + O(x^60)) \\ Colin Barker, Oct 01 2016

From Colin Barker, Oct 01 2016: (Start)
a(n) = 2*a(n-1)-a(n-2)+2*a(n-3)-4*a(n-4)+2*a(n-5)-a(n-6)+2*a(n-7)-a(n-8) for n>8.
G.f.: 2*x / ((1-x)^4*(1+x+x^2)^2).
(End)

More terms from N. J. A. Sloane, May 17 2013

cp's OEIS Frontend

A159797 Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n-1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A014125 Bisection of A001400.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

Sage

Formula

Extensions

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A190717 Triplicated tetrahedral numbers A000292.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A144678 Related to enumeration of quantum states (see reference for precise definition).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A144679 a(n) = [n/5 + 1]*[n/5 + 2]*(3*n - 10*[n/5] + 3)/6, where [.] = floor.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

A144679 a(n) = [n/5 + 1][n/5 + 2](3n - 10[n/5] + 3)/6, where [.] = floor.

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