A000538 -id:A000538 - cp's OEIS frontend

A107891 a(n) = (n+1)(n+2)^2(n+3)^2(n+4)(3n^2 + 15n + 20)/2880.

1, 19, 155, 805, 3136, 9996, 27468, 67320, 150645, 313027, 611611, 1134497, 2012920, 3436720, 5673648, 9093096, 14194881, 21643755, 32310355, 47319349, 68105576, 96479020, 134699500, 185562000, 252493605, 339663051, 452103939

Offset: 0

Emeric Deutsch, Jun 12 2005

Kekulé numbers for certain benzenoids.

Partial sums of A114239. First differences of A047819. - Peter Bala, Sep 21 2007

S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (see pp. 167, 187 and p. 105 eq. (iii) for k=2 and m=5).

Shawn A. Broyles, Table of n, a(n) for n = 0..1000
Paolo Aluffi, Degrees of projections of rank loci, arXiv:1408.1702 [math.AG], 2014. ["After compiling the results of many explicit computations, we noticed that many of the numbers d_{n,r,S} appear in the existing literature in contexts far removed from the enumerative geometry of rank conditions; we owe this surprising (to us) observation to perusal of [Slo14]."]
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A005585, A006542, A047819, A114239, A114242.

a:=n->(1/2880)*(n+1)*(n+2)^2*(n+3)^2*(n+4)*(3*n^2+15*n+20): seq(a(n),n=0..32);

Table[((1+n) (2+n)^2 (3+n)^2 (4+n) (20+3 n (5+n)))/2880,{n,0,40}] (* or *) LinearRecurrence[{9,-36,84,-126,126,-84,36,-9,1},{1,19,155,805,3136,9996,27468,67320,150645},40] (* Harvey P. Dale, Dec 10 2021 *)

a(n-2) = (1/8) * Sum_{1 <= x_1, x_2 <= n} (x_1*x_2)^2*(det V(x_1,x_2))^2 = 1/8*sum {1 <= i,j <= n} (i*j*(i-j))^2, where V(x_1,x_2) is the Vandermonde matrix of order 2. - Peter Bala, Sep 21 2007
G.f.: (1+10*x+20*x^2+10*x^3+x^4)/(1-x)^9. - Colin Barker, Feb 08 2012
a(n) = (A000330(n+2)*A000538(n+2) - (A000537(n+2))^2)/4. - J. M. Bergot, Sep 17 2013
Sum_{n>=0} 1/a(n) = 17095/4 - 240*Pi^2 - 162*sqrt(15)*Pi*tanh(sqrt(5/3)*Pi/2). - Amiram Eldar, May 29 2022

A154230 Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)(n+2)(2n+3)(3n^2+9n+5)/30)*T(n-2, k-1), read by rows.

Original entry on oeis.org

1, 1, 1, 1, 100, 1, 1, 455, 455, 1, 1, 1435, 98810, 1435, 1, 1, 3711, 1135370, 1135370, 3711, 1, 1, 8388, 7849141, 464306300, 7849141, 8388, 1, 1, 17161, 40410421, 10431621081, 10431621081, 40410421, 17161, 1, 1, 32495, 169040786, 130822910455, 7140071740062, 130822910455, 169040786, 32495, 1

Offset: 0

Roger L. Bagula, Jan 05 2009

Row sums are: {1, 2, 102, 912, 101682, 2278164, 480021360, 20944097328, ...}.

The row sums of this class of sequences (see cross references) is given by the following. Let S(n) be the row sum then S(n) = 2*S(n-1) + f(n)*S(n-2) for a given f(n). For this sequence f(n) = (n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30 = A000538(n+1). - G. C. Greubel, Mar 02 2021

			Triangle begins as:
  1;
  1,     1;
  1,   100,        1;
  1,   455,      455,           1;
  1,  1435,    98810,        1435,           1;
  1,  3711,  1135370,     1135370,        3711,        1;
  1,  8388,  7849141,   464306300,     7849141,     8388,     1;
  1, 17161, 40410421, 10431621081, 10431621081, 40410421, 17161, 1;

G. C. Greubel, Rows n = 0..50 of the triangle, flattened

Cf. A154227, A154228, A154229, A154231, A154233.

Cf. A000538.

f:= func< n | (n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30 >;
function T(n,k)
  if k eq 0 or k eq n then return 1;
  else return T(n-1, k) + T(n-1, k-1) + f(n)*T(n-2, k-1);
  end if; return T;
end function;
[T(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Mar 02 2021

T:= proc(n, k) option remember;
      if k=0 or k=n then 1
    else T(n-1, k) +T(n-1, k-1) +((n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30)*T(n-2, k-1)
      fi; end:
seq(seq(T(n, k), k=0..n), n=0..12); # G. C. Greubel, Mar 02 2021

T[n_, k_]:= T[n,k]= If[k==0 || k==n, 1, T[n-1, k] + T[n-1, k-1] + ((n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30)*T[n-2, k-1] ];
Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* modified by G. C. Greubel, Mar 02 2021 *)

def f(n): return (n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30
def T(n,k):
    if (k==0 or k==n): return 1
    else: return T(n-1, k) + T(n-1, k-1) + f(n)*T(n-2, k-1)
flatten([[T(n,k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Mar 02 2021

T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30)*T(n-2, k-1) with T(n, 0) = T(n, n) = 1.

Edited by G. C. Greubel, Mar 02 2021

A254470 Sixth partial sums of fourth powers (A000583).

Original entry on oeis.org

1, 22, 198, 1134, 4884, 17226, 52338, 141570, 348777, 795652, 1701700, 3444948, 6651216, 12321804, 22011804, 38073948, 63985977, 104782986, 167620090, 262495090, 403165620, 608300550, 902911230, 1320114510, 1903286385, 2708672616, 3808530792, 5294887048

Offset: 1

Luciano Ancora, Feb 15 2015

			First differences:   1, 15,  65, 175,  369,   671, ... (A005917)
-------------------------------------------------------------------------
The fourth powers:   1, 16,  81, 256,  625,  1296, ... (A000583)
-------------------------------------------------------------------------
First partial sums:  1, 17,  98, 354,  979,  2275, ... (A000538)
Second partial sums: 1, 18, 116, 470, 1449,  3724, ... (A101089)
Third partial sums:  1, 19, 135, 605, 2054,  5778, ... (A101090)
Fourth partial sums: 1, 20, 155, 760, 2814,  8592, ... (A101091)
Fifth partial sums:  1, 21, 176, 936, 3750, 12342, ... (A254681)
Sixth partial sums:  1, 22, 198,1134, 4884, 17226, ... (this sequence)

Luciano Ancora, Table of n, a(n) for n = 1..1000
Luciano Ancora, Partial sums of m-th powers with Faulhaber polynomials.
Luciano Ancora, Pascal’s triangle and recurrence relations for partial sums of m-th powers.
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

Cf. A000538, A000583, A005917, A101089, A101090, A101091, A254469, A254471, A254472, A254681.

[n*(1+n)*(2+n)*(3+n)^2*(4+n)*(5+n)*(6+n)*(1+12*n+ 2*n^2)/302400: n in [1..30]]; // Vincenzo Librandi, Feb 15 2015

Table[n (1 + n) (2 + n) (3 + n)^2 (4 + n) (5 + n) (6 + n) (1 + 12 n + 2 n^2)/302400,{n, 25}] (* or *) CoefficientList[Series[(- 1 - 11 x - 11 x^2 - x^3)/(- 1 + x)^11, {x, 0, 24}], x]
Nest[Accumulate,Range[30]^4,6] (* or *) LinearRecurrence[{11,-55,165,-330,462,-462,330,-165,55,-11,1},{1,22,198,1134,4884,17226,52338,141570,348777,795652,1701700},30] (* Harvey P. Dale, Apr 23 2016 *)

vector(50,n,n*(1 + n)*(2 + n)*(3 + n)^2*(4 + n)*(5 + n)*(6 + n)*(1 + 12*n + 2*n^2)/302400) \\ Derek Orr, Feb 19 2015

G.f.: (-x - 11*x^2 - 11*x^3 - x^4)/(- 1 + x)^11.
a(n) = n*(1 + n)*(2 + n)*(3 + n)^2*(4 + n)*(5 + n)*(6 + n)*(1 + 12*n + 2*n^2)/302400.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) + n^4.
Sum_{n>=1} 1/a(n) = 3320303/2601 + 1400*Pi^2/17 + (8960/17)*sqrt(2/17)*Pi*cot(sqrt(17/2)*Pi). - Amiram Eldar, Jan 26 2022

A254870 Seventh partial sums of fourth powers (A000583).

Original entry on oeis.org

1, 23, 221, 1355, 6239, 23465, 75803, 217373, 566150, 1361802, 3063502, 6508450, 13159666, 25481470, 47493274, 85567222, 149553199, 254336185, 421956275, 684451365, 1087616985, 1695917535, 2598828765, 3918943275, 5822229660, 8530902276, 12339433068

Offset: 1

Luciano Ancora, Feb 17 2015

			Second differences:   2, 14,  50,  110,  194,   302, ...   A120328(2k+1)
First differences:    1, 15,  65,  175,  369,   671, ...   A005917
--------------------------------------------------------------------------
The fourth powers:    1, 16,  81,  256,  625,  1296, ...   A000583
--------------------------------------------------------------------------
First partial sums:   1, 17,  98,  354,  979,  2275, ...   A000538
Second partial sums:  1, 18, 116,  470, 1449,  3724, ...   A101089
Third partial sums:   1, 19, 135,  605, 2054,  5778, ...   A101090
Fourth partial sums:  1, 20, 155,  760, 2814,  8592, ...   A101091
Fifth partial sums:   1, 21, 176,  936, 3750, 12342, ...   A254681
Sixth partial sums:   1, 22, 198, 1134, 4884, 17226, ...   A254470
Seventh partial sums: 1, 23, 221, 1355, 6239, 23465, ...   (this sequence)

Luciano Ancora, Table of n, a(n) for n = 1..1000
Luciano Ancora, Partial sums of m-th powers with Faulhaber polynomials
Luciano Ancora, Pascal’s triangle and recurrence relations for partial sums of m-th powers
Index entries for linear recurrences with constant coefficients, signature (12,-66,220,-495,792,-924,792,-495,220,-66,12,-1).

Cf. A000538, A000583, A005917, A101089, A101090, A101091, A254681, A254470, A254869, A254871, A254872.

[n*(1+n)*(2+n)*(3+n)*(4+n)*(5+n)*(6+n)*(7+n)*(7+2*n)*(7 +42*n+6*n^2)/19958400: n in [1..30]]; // Vincenzo Librandi, Feb 19 2015

Table[n (1 + n) (2 + n) (3 + n) (4 + n) (5 + n) (6 + n) (7 + n) (7 + 2 n)((7 + 42 n + 6 n^2)/19958400), {n, 24}] (* or *)
CoefficientList[Series[(1 + 11 x + 11 x^2 + x^3)/(- 1 + x)^12, {x, 0, 23}], x]

vector(50,n,n*(1 + n)*(2 + n)*(3 + n)*(4 + n)*(5 + n)*(6 + n)*(7 + n)*(7 + 2*n)*(7 + 42*n + 6*n^2)/19958400) \\ Derek Orr, Feb 19 2015

G.f.: (x + 11*x^2 + 11*x^3 + x^4)/(- 1 + x)^12.
a(n) = n*(1 + n)*(2 + n)*(3 + n)*(4 + n)*(5 + n)*(6 + n)*(7 + n)*(7 + 2*n)*(7 + 42*n + 6*n^2)/19958400.
a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7) + n^4.

A317983 Expansion of 420x(1 + x)(1 + 10x + x^2) / (1 - x)^6.

Original entry on oeis.org

420, 7140, 41160, 148680, 411180, 955500, 1963920, 3684240, 6439860, 10639860, 16789080, 25498200, 37493820, 53628540, 74891040, 102416160, 137494980, 181584900, 236319720, 303519720, 385201740, 483589260, 601122480, 740468400, 904530900, 1096460820

Offset: 1

Colin Barker, Aug 13 2018

Seems to be the negative of the third column of A316387.

Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1).

Cf. A000538, A316387, A317981, A317982, A317984.

Vec(420*x*(1 + x)*(1 + 10*x + x^2) / (1 - x)^6 + O(x^40))

a(n) = 84*n^5 + 210*n^4 + 140*n^3 - 14*n

G.f.: 420*x*(1 + x)*(1 + 10*x + x^2) / (1 - x)^6.
a(n) = 420 * A000538(n).
a(n) = 84*n^5 + 210*n^4 + 140*n^3 - 14*n.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6.

A123094 Sum of first n 12th powers.

Original entry on oeis.org

0, 1, 4097, 535538, 17312754, 261453379, 2438235715, 16279522916, 84998999652, 367428536133, 1367428536133, 4505856912854, 13421957361110, 36720042483591, 93413954858887, 223160292749512, 504635269460168, 1087257506689929, 2244088888116105, 4457403807182266

Offset: 0

Zerinvary Lajos, Sep 27 2006

T. D. Noe, Table of n, a(n) for n = 0..1000
Bruno Berselli, A description of the recursive method in Formula lines (first formula): website Matem@ticamente (in Italian).

Sequences of the form Sum_{j=0..n} j^m : A000217 (m=1), A000330 (m=2), A000537 (m=3), A000538 (m=4), A000539 (m=5), A000540 (m=6), A000541 (m=7), A000542 (m=8), A007487 (m=9), A023002 (m=10), A123095 (m=11), this sequence (m=12), A181134 (m=13).
Cf. A008456, A215083.
Cf. A008275, A008277.

[(&+[j^12: j in [0..n]]): j in [0..30]]; // G. C. Greubel, Jul 21 2021

Maple
```
[seq(add(i^12, i=1..n), n=0..18)];
```

Table[Sum[k^12, {k, n}], {n, 0, 30}] (* Vladimir Joseph Stephan Orlovsky, Aug 14 2008 *)
Accumulate[Range[0,30]^12]  (* Harvey P. Dale, Apr 26 2011 *)

A123094_list, m = [0], [479001600, -2634508800, 6187104000, -8083152000, 6411968640, -3162075840, 953029440, -165528000, 14676024, -519156, 4094, -1, 0 , 0]
for _ in range(10**2):
    for i in range(13):
        m[i+1]+= m[i]
    A123094_list.append(m[-1]) # Chai Wah Wu, Nov 05 2014

[bernoulli_polynomial(n,13)/13 for n in range(1, 30)] # Zerinvary Lajos, May 17 2009

a(n) = n*A123095(n) - Sum_{i=0..n-1} A123095(i). - Bruno Berselli, Apr 27 2010
a(n) = n * (n+1) * (2*n+1) * (105*n^10 +525*n^9 +525*n^8 -1050*n^7 -1190*n^6 +2310*n^5 +1420*n^4 -3285*n^3 -287*n^2 +2073*n -691)/2730. - Bruno Berselli, Oct 03 2010
a(n) = (-1)*Sum_{j=1..12} j*Stirling1(n+1,n+1-j)*Stirling2(n+12-j,n). - Mircea Merca, Jan 25 2014

A123095 Sum of first n 11th powers.

Original entry on oeis.org

0, 1, 2049, 179196, 4373500, 53201625, 415998681, 2393325424, 10983260016, 42364319625, 142364319625, 427675990236, 1170684360924, 2962844754961, 7012409924625, 15662165784000, 33254351828416, 67526248136049, 131794658215281, 248284917113500, 453084917113500

Offset: 0

Zerinvary Lajos, Sep 27 2006

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Bruno Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
Index entries for linear recurrences with constant coefficients, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).

Sequences of the form Sum_{j=0..n} j^m : A000217 (m=1), A000330 (m=2), A000537 (m=3), A000538 (m=4), A000539 (m=5), A000540 (m=6), A000541 (m=7), A000542 (m=8), A007487 (m=9), A023002 (m=10), this sequence (m=11), A123094 (m=12), A181134 (m=13).
Cf. A008455, A215083.
Cf. A008275, A008277.

[(&+[j^11: j in [0..n]]): n in [0..30]]; // G. C. Greubel, Jul 21 2021

[seq(add(i^11, i=1..n), n=0..20)];
a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=a[n-1]+n^11 od: seq(a[n], n=0..13); # Zerinvary Lajos, Feb 22 2008

Table[Sum[k^11, {k, n}], {n, 0, 30}] (* Vladimir Joseph Stephan Orlovsky, Aug 14 2008 *)
Accumulate[Range[0,20]^11] (* Harvey P. Dale, Sep 17 2021 *)

A123095_list, m = [0], [39916800, -199584000, 419126400, -479001600, 322494480, -129230640, 29607600, -3498000, 171006, -2046, 1, 0 , 0]
for _ in range(10**2):
    for i in range(12):
        m[i+1]+= m[i]
    A123095_list.append(m[-1]) # Chai Wah Wu, Nov 05 2014

[(bernoulli_polynomial(n+1, 12) - bernoulli(12))/12  for n in (0..30)] # G. C. Greubel, Jul 21 2021

a(n) = n*A023002(n) - Sum_{i=0..n-1} A023002(i). - Bruno Berselli, Apr 27 2010
a(n) = n^2*(n+1)^2*(2*n^8 +8*n^7 +4*n^6 -16*n^5 -5*n^4 +26*n^3 -3*n^2 -20*n +10)/24. - Bruno Berselli, Oct 03 2010
G.f.: x*(x^10 +2036*x^9 +152637*x^8 +2203488*x^7 +9738114*x^6 +15724248*x^5 +9738114*x^4 +2203488*x^3 +152637*x^2 +2036*x +1)/(1-x)^13. - Colin Barker, May 27 2012
a(n) = (-1)*Sum_{j=1..11} j*Stirling1(n+1,n+1-j)*Stirling2(n+11-j,n). - Mircea Merca, Jan 25 2014
a(n) = 1728*A006542(n+2)^2 + 216*A288876(n-2) + 96*A006542(n+2) + A000537(n). - Yasser Arath Chavez Reyes, May 25 2024

A135276 a(0)=0, a(1)=1; for n>1, a(n) = a(n-1) + n^0 if n odd, a(n) = a(n-1) + n^1 if n is even.

Original entry on oeis.org

0, 1, 3, 4, 8, 9, 15, 16, 24, 25, 35, 36, 48, 49, 63, 64, 80, 81, 99, 100, 120, 121, 143, 144, 168, 169, 195, 196, 224, 225, 255, 256, 288, 289, 323, 324, 360, 361, 399, 400, 440, 441, 483, 484, 528, 529, 575, 576, 624, 625, 675, 676, 728, 729, 783, 784, 840, 841, 899, 900, 960, 961

Offset: 0

Artur Jasinski, May 12 2008, corrected May 17 2008

Index to family of sequences of the form a(n) = a(n-1) + n^r if n odd, a(n) = a(n-1)+ n^s if n is even, for n > 1 and a(1)=1:
         s=0,     s=1,      s=2,     s=3,     s=4,     s=5
  r=0, A000027, this seq, A135301, A135332, A140142, A140143;
  r=1, A140144, A000217,  A140113, A140145, A140146, A140147;
  r=2, A140148, A136047,  A000330, A140149, A140150, A140151;
  r=3, A140152, A140153,  A140154, A000537, A140155, A140156;
  r=4, A140157, A140158,  A140159, A140160, A000538, A140161;
  r=5, A140162, A140163,  A135095, A135099, A135214, A000539.
Equals triangle A070909 * [1,2,3,...]. - Gary W. Adamson, May 16 2010
Right edge of the triangle in A199332: a(n) = A199332(n,n), for n > 0. - Reinhard Zumkeller, Nov 23 2011

G. C. Greubel, Table of n, a(n) for n = 0..1000
Girtrude Hamm, Classification of lattice triangles by their two smallest widths, arXiv:2304.03007 [math.CO], 2023.
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A000027, A000217, A000330, A000537, A000538, A000539, A004526, A136047, A140113.

Cf. A070909. - Gary W. Adamson, May 16 2010

[(2*n^2+6*n+1+(2*n-1)*(-1)^n)/8 : n in [0..100]]; // Wesley Ivan Hurt, Mar 22 2016

A135276:=n->( 2*n^2 + 6*n + 1 + (2*n-1)*(-1)^n )/8: seq(A135276(n), n=0..100); # Wesley Ivan Hurt, Mar 22 2016

a = {}; r = 0; s = 1; Do[k = 0; Do[k = k + (Sin[Pi m/2]^2) m^r + (Cos[Pi m/2]^2) m^s, {m, 1, n}]; AppendTo[a, k], {n, 0, 100}]; a (* Artur Jasinski *)
LinearRecurrence[{1, 2, -2, -1, 1}, {0, 1, 3, 4, 8}, 50] (* G. C. Greubel, Oct 08 2016 *)

A135276(n)=if(n%2,((n+1)/2)^2,(n/2+1)^2-1) \\ M. F. Hasler, May 17 2008

my(x='x+O('x^200)); concat(0, Vec(x*(1+2*x-x^2)/((1+x)^2*(1-x)^3))) \\ Altug Alkan, Mar 23 2016

a(n) = (n/2 + 1)^2 - 1 if n is even, ((n+1)/2)^2 if n is odd. - M. F. Hasler, May 17 2008
From R. J. Mathar, Feb 22 2009: (Start)
G.f.: x*(1+2*x-x^2)/((1+x)^2*(1-x)^3).
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5). (End)
a(n) = (2*n^2 + 6*n + 1 + (2*n-1)*(-1)^n)/8. - Luce ETIENNE, Jul 08 2014
a(n) = (floor(n/2)+1)^2 + (n mod 2) - 1. - Wesley Ivan Hurt, Mar 22 2016
a(n) = A004526((n+1)^2) - A004526(n+1)^2. - Bruno Berselli, Oct 21 2016
Sum_{n>=1} 1/a(n) = 3/4 + Pi^2/6. - Amiram Eldar, Sep 08 2022

Offset corrected by R. J. Mathar, Feb 22 2009

Edited by Michel Marcus, Apr 07 2023

A181134 Sum of 13th powers: a(n) = Sum_{j=0..n} j^13.

Original entry on oeis.org

0, 1, 8193, 1602516, 68711380, 1289414505, 14350108521, 111239118928, 660994932816, 3202860761145, 13202860761145, 47725572905076, 154718778284148, 457593884876401, 1251308658130545, 3197503726489920

Offset: 0

Bruno Berselli, Oct 05 2010 - Oct 18 2010

This form of recurrence is a general property of the array in A103438 (sums of the first n-th powers).

Bruno Berselli, Table of n, a(n) for n = 0..10000.
Bruno Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian), 2008.
Index entries for linear recurrences with constant coefficients, signature (15,-105,455,-1365,3003,-5005,6435,-6435,5005,-3003,1365,-455,105,-15,1).

Cf. A010801.
Sequences of the form Sum_{j=0..n} j^m : A000217 (m=1), A000330 (m=2), A000537 (m=3), A000538 (m=4), A000539 (m=5), A000540 (m=6), A000541 (m=7), A000542 (m=8), A007487 (m=9), A023002 (m=10), A123095 (m=11), A123094 (m=12), A181134 (m=13).
Cf. A215083, A253712.

[(&+[j^13: j in [0..n]]): n in [0..30]]; // G. C. Greubel, Jul 21 2021

A181134 := proc(n) (bernoulli(14,n+1) - bernoulli(14))/14 ; end proc: seq(A181134(n), n=0..10); # R. J. Mathar, Oct 14 2010

Accumulate[Range[0,20]^13] (* Harvey P. Dale, Oct 30 2017 *)

A181134_list, m = [0], [6227020800, -37362124800, 97037740800, -142702560000, 130456085760, -76592355840, 28805736960, -6711344640, 901020120, -60780720, 1569750, -8190, 1, 0 , 0]
for _ in range(10**2):
    for i in range(14):
        m[i+1]+= m[i]
    A181134_list.append(m[-1]) # Chai Wah Wu, Nov 06 2014

[(bernoulli_polynomial(n+1, 14) - bernoulli(14))/14  for n in (0..30)] # G. C. Greubel, Jul 21 2021

For n>0, a(n) = n*A123094(n) - Sum_{i=0..n-1} A123094(i), where Sum_{i=0..n-1} A123094(i) = A253712(n-1) = (n-1)*n^2*(n+1)*(30*n^10 - 425*n^8 + 2578*n^6 - 8147*n^4 + 12874*n^2 - 7601)/5460.
a(n) = a(-n-1) = (n*(n + 1))^2*(30*n^10 + 150*n^9 + 125*n^8 - 400*n^7 - 326*n^6 + 1052*n^5 + 367*n^4 - 1786*n^3 + 202*n^2 + 1382*n - 691)/420.
G.f.: see comment of Vladeta Jovovic in A000538.
a(n) = -Sum_{j=1..13} j*Stirling1(n+1,n+1-j)*Stirling2(n+13-j,n). - Mircea Merca, Jan 25 2014

A202670 Symmetric matrix based on A000290 (the squares), by antidiagonals.

Original entry on oeis.org

1, 4, 4, 9, 17, 9, 16, 40, 40, 16, 25, 73, 98, 73, 25, 36, 116, 184, 184, 116, 36, 49, 169, 298, 354, 298, 169, 49, 64, 232, 440, 584, 584, 440, 232, 64, 81, 305, 610, 874, 979, 874, 610, 305, 81, 100, 388, 808, 1224, 1484, 1484, 1224, 808, 388, 100, 121

Offset: 1

Clark Kimberling, Dec 22 2011

Let s=(1,4,9,16,...) and let T be the infinite square matrix whose n-th row is formed by putting n-1 zeros before the terms of s.  Let T' be the transpose of T.  Then A202670 represents the matrix product M=T'*T.  M is the self-fusion matrix of s, as defined at A193722.  See A202671 for characteristic polynomials of principal submatrices of M.
...
row 1 (1,4,9,16,...) A000290
row 2 (4,17,40,73,...) A145995
diagonal (1,17,98,354,...) A000538
antidiagonal sums (1,8,35,112,...) A040977
...
The n-th "square border sum" m(n,1)+m(n,2)+...+m(n,n)+m(n-1,n)+m(n-2,n)+...+m(1,n) is a squared square pyramidal number: [n*(n+1)*(2*n+1)/6]^2; see A000330.

			Northwest corner:
1.....4......9....16....25
4....17.....40....73...116
9....40.....98...184...298
16...73....184...354...584
25...116...298...584...979

Cf. A000290, A202671, A193722.

U = NestList[Most[Prepend[#, 0]] &, #, Length[#] - 1] &[ Table[k^2, {k, 1, 12}]];
L = Transpose[U]; M = L.U; TableForm[M]
m[i_, j_] := M[[i]][[j]];
Flatten[Table[m[i, n + 1 - i], {n, 1, 12}, {i, 1, n}]]

cp's OEIS Frontend

A107891 a(n) = (n+1)*(n+2)^2*(n+3)^2*(n+4)*(3n^2 + 15n + 20)/2880.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A154230 Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)*(2*n+3)*(3*n^2+9*n+5)/30)*T(n-2, k-1), read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

Extensions

A254470 Sixth partial sums of fourth powers (A000583).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A254870 Seventh partial sums of fourth powers (A000583).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A317983 Expansion of 420*x*(1 + x)*(1 + 10*x + x^2) / (1 - x)^6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Formula

A123094 Sum of first n 12th powers.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Python

Sage

Formula

A123095 Sum of first n 11th powers.

Views

Author

Keywords

A107891 a(n) = (n+1)(n+2)^2(n+3)^2(n+4)(3n^2 + 15n + 20)/2880.

A154230 Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)(n+2)(2n+3)(3n^2+9n+5)/30)*T(n-2, k-1), read by rows.

A317983 Expansion of 420x(1 + x)(1 + 10x + x^2) / (1 - x)^6.