A024003 -id:A024003 - cp's OEIS frontend

A300656 Triangle read by rows: T(n,k) = 30k^2(n-k)^2 + 1; n >= 0, 0 <= k <= n.

1, 1, 1, 1, 31, 1, 1, 121, 121, 1, 1, 271, 481, 271, 1, 1, 481, 1081, 1081, 481, 1, 1, 751, 1921, 2431, 1921, 751, 1, 1, 1081, 3001, 4321, 4321, 3001, 1081, 1, 1, 1471, 4321, 6751, 7681, 6751, 4321, 1471, 1, 1, 1921, 5881, 9721, 12001, 12001, 9721, 5881, 1921, 1

Offset: 0

Kolosov Petro, Mar 10 2018

From Kolosov Petro, Apr 12 2020: (Start)
Let A(m, r) = A302971(m, r) / A304042(m, r).
Let L(m, n, k) = Sum_{r=0..m} A(m, r) * k^r * (n - k)^r.
Then T(n, k) = L(2, n, k).
Fifth power can be expressed as row sum of triangle T(n, k).
T(n, k) is symmetric: T(n, k) = T(n, n-k). (End)

			Triangle begins:
--------------------------------------------------------------------------
k=    0     1     2      3      4      5      6      7     8     9    10
--------------------------------------------------------------------------
n=0:  1;
n=1:  1,    1;
n=2:  1,   31,    1;
n=3:  1,  121,  121,     1;
n=4:  1,  271,  481,   271,     1;
n=5:  1,  481, 1081,  1081,   481,     1;
n=6:  1,  751, 1921,  2431,  1921,   751,     1;
n=7:  1, 1081, 3001,  4321,  4321,  3001,  1081,     1;
n=8:  1, 1471, 4321,  6751,  7681,  6751,  4321,  1471,    1;
n=9:  1, 1921, 5881,  9721, 12001, 12001,  9721,  5881, 1921,    1;
n=10: 1, 2431, 7681, 13231, 17281, 18751, 17281, 13231, 7681, 2431,   1;

Kolosov Petro, Rows n = 0..2078 of triangle, flattened.
Petro Kolosov, On the link between binomial theorem and discrete convolution, arXiv:1603.02468 [math.NT], 2016-2025.
Petro Kolosov, Polynomial identity involving binomial theorem and Faulhaber's formula, 2023.
Petro Kolosov, History and overview of the polynomial P_b^m(x), 2024.

Various cases of L(m, n, k): A287326(m=1), This sequence (m=2), A300785(m=3). See comments for L(m, n, k).
Row sums give the nonzero terms of A002561.
Cf. A000584, A287326, A007318, A077028, A294317, A068236, A302971, A304042, A002561, A258807, A158558, A094053, A024003, A316349.

T:=Flat(List([0..9],n->List([0..n],k->30*k^2*(n-k)^2+1))); # Muniru A Asiru, Oct 24 2018

[[30*k^2*(n-k)^2+1: k in [0..n]]: n in [0..12]]; // G. C. Greubel, Dec 14 2018

a:=(n,k)->30*k^2*(n-k)^2+1: seq(seq(a(n,k),k=0..n),n=0..9); # Muniru A Asiru, Oct 24 2018

T[n_, k_] := 30 k^2 (n - k)^2 + 1; Column[
Table[T[n, k], {n, 0, 10}, {k, 0, n}], Center] (* Kolosov Petro, Apr 12 2020 *)
f[n_]:=Table[SeriesCoefficient[(1 + 26 y + 336 y^2 + 326 y^3 + 31 y^4 + x^2 (1 + 116 y + 486 y^2 + 116 y^3 + y^4) + x (-2 - 82 y - 882 y^2 - 502 y^3 + 28 y^4))/((-1 + x)^3 (-1 + y)^5), {x, 0, i}, {y, 0, j}], {i, n, n}, {j, 0, n}]; Flatten[Array[f, 11, 0]] (* Stefano Spezia, Oct 30 2018 *)

t(n, k) = 30*k^2*(n-k)^2+1
trianglerows(n) = for(x=0, n-1, for(y=0, x, print1(t(x, y), ", ")); print(""))
/* Print initial 9 rows of triangle as follows */ trianglerows(9)

[[30*k^2*(n-k)^2+1 for k in range(n+1)] for n in range(12)] # G. C. Greubel, Dec 14 2018

From Kolosov Petro, Apr 12 2020: (Start)
T(n, k) = 30 * k^2 * (n-k)^2 + 1.
T(n, k) = 30 * A094053(n,k)^2 + 1.
T(n, k) = A158558((n-k) * k).
T(n+2, k) = 3*T(n+1, k) - 3*T(n, k) + T(n-1, k), for n >= k.
Sum_{k=1..n} T(n, k) = A000584(n).
Sum_{k=0..n-1} T(n, k) = A000584(n).
Sum_{k=0..n} T(n, k) = A002561(n).
Sum_{k=1..n-1} T(n, k) = A258807(n).
Sum_{k=1..n-1} T(n, k) = -A024003(n), n > 1.
Sum_{k=1..r} T(n, k) = A316349(2,r,0)*n^0 - A316349(2,r,1)*n^1 + A316349(2,r,2)*n^2. (End)
G.f.: (1 + 26*y + 336*y^2 + 326*y^3 + 31*y^4 + x^2*(1 + 116*y + 486*y^2 + 116*y^3 + y^4) + x*(-2 - 82*y - 882*y^2 - 502*y^3 + 28*y^4))/((-1 + x)^3*(-1 + y)^5). - Stefano Spezia, Oct 30 2018

A258807 a(n) = n^5 - 1.

Original entry on oeis.org

0, 31, 242, 1023, 3124, 7775, 16806, 32767, 59048, 99999, 161050, 248831, 371292, 537823, 759374, 1048575, 1419856, 1889567, 2476098, 3199999, 4084100, 5153631, 6436342, 7962623, 9765624, 11881375, 14348906, 17210367, 20511148, 24299999, 28629150, 33554431

Offset: 1

Vincenzo Librandi, Jun 11 2015

Muniru A Asiru, Table of n, a(n) for n = 1..5000
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1).

Subsequence of A181124.
Cf. A024003, A024049, A300656.
Sequences of the type n^k-1: A132411 (k=2), A068601 (k=3), A123865 (k=4), this sequence (k=5), A123866 (k=6), A258808 (k=7), A258809 (k=8), A258810 (k=9), A123867 (k=10), A258812 (k=11), A123868 (k=12).

List([1..35],n->n^5-1); # Muniru A Asiru, Oct 28 2018

Magma
```
[n^5-1: n in [1..50]];
```

I:=[0,31,242,1023, 3124,7775]; [n le 6 select I[n] else 6*Self(n-1)-15*Self(n-2)+20*Self(n-3)-15*Self(n-4)+ 6*Self(n-5)-Self(n-6): n in [1..50]];

seq(n^5-1,n=1..35); # Muniru A Asiru, Oct 28 2018

Table[n^5 - 1, {n, 1, 50}] (* or *) LinearRecurrence[{6, -15, 20, -15, 6, -1}, {0, 31, 242, 1023, 3124, 7775}, 50]

a(n)=n^5-1 \\ Charles R Greathouse IV, Jun 11 2015

for n in range(1, 50): print(n**5 - 1, end=', ') # Stefano Spezia, Oct 28 2018

[n^5-1 for n in (1..50)] # Bruno Berselli, Jun 11 2015

G.f.: x^2*(31 + 56*x + 36*x^2 - 4*x^3 + x^4)/(1 - x)^6.
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).
a(n) = -A024003(n). - Bruno Berselli, Jun 11 2015
Sum_{n>=2} 1/a(n) = Sum_{n>=1} (zeta(5*n) - 1) = 0.0379539032... - Amiram Eldar, Nov 06 2020

A258837 a(n) = 1 - n^2.

Original entry on oeis.org

1, 0, -3, -8, -15, -24, -35, -48, -63, -80, -99, -120, -143, -168, -195, -224, -255, -288, -323, -360, -399, -440, -483, -528, -575, -624, -675, -728, -783, -840, -899, -960, -1023, -1088, -1155, -1224, -1295, -1368, -1443, -1520, -1599, -1680, -1763, -1848

Offset: 0

Vincenzo Librandi, Jun 12 2015

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

Cf. A067998, A131386, A007531.

Sequences of the type 1-n^k: A024000 (k=1), this sequence (k=2), A024001 (k=3), A024002 (k=4), A024003 (k=5), A024004 (k=6), A024005 (k=7), A024006 (k=8), A024007 (k=9), A024008 (k=10), A024009 (k=11), A024010 (k=12).

Magma
```
[1-n^2: n in [0..50]];
```

I:=[1,0,-3]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..50]];

Table[1 - n^2, {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {1, 0, -3}, 50]

my(x='x+O('x^50)); Vec((1-3*x)/(1-x)^3) \\ G. C. Greubel, May 11 2017

G.f.: (1-3*x)/(1-x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
a(n) = -A067998(n+1). - Joerg Arndt, Jun 13 2015
a(n) = (-1)^n*A131386(n+1). - Bruno Berselli, Jun 15 2015
E.g.f.: (1 - x - x^2)*exp(x). - G. C. Greubel, May 11 2017
Sum_{n>=2} 1/a(n) = -3/4. - Amiram Eldar, Feb 17 2023

A155121 a(n) = 2n(1 + n + n^2 + n^3) - 3.

Original entry on oeis.org

-3, 5, 57, 237, 677, 1557, 3105, 5597, 9357, 14757, 22217, 32205, 45237, 61877, 82737, 108477, 139805, 177477, 222297, 275117, 336837, 408405, 490817, 585117, 692397, 813797, 950505, 1103757, 1274837, 1465077, 1675857

Offset: 0

Roger L. Bagula, Jan 20 2009

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

Cf. A024003, A071237, A142463, A155120.

[2*n*(1+n+n^2+n^3)-3: n in [0..40] ]; // Vincenzo Librandi, May 23 2011

seq( -3 +2*n +2*n^2 +2*n^3 +2*n^4, n=0..40); # G. C. Greubel, Mar 25 2021

Table[-3 +2n +2n^2 +2n^3 +2n^4, {n, 0, 30}]

[-3 +2*n +2*n^2 +2*n^3 +2*n^4 for n in (0..40)] # G. C. Greubel, Mar 25 2021

a(n) = 2*n*(1 + n + n^2 + n^3) - 3.
G.f.: (3 - 20*x - 2*x^2 - 32*x^3 + 3*x^4)/(x-1)^5.
From Bruno Berselli, Dec 16 2010: (Start)
a(n) = 4*A071237(n) - 3.
a(n) = 2*A024003(n)/(1-n) - 5 (n>1). (End)
E.g.f.: (-3 + 8*x + 22*x^2 + 14*x^3 + 2*x^4)*exp(x). - G. C. Greubel, Mar 25 2021

cp's OEIS Frontend

A300656 Triangle read by rows: T(n,k) = 30*k^2*(n-k)^2 + 1; n >= 0, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A258807 a(n) = n^5 - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

A258837 a(n) = 1 - n^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Magma

Mathematica

PARI

Formula

A155121 a(n) = 2*n*(1 + n + n^2 + n^3) - 3.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A300656 Triangle read by rows: T(n,k) = 30k^2(n-k)^2 + 1; n >= 0, 0 <= k <= n.

A155121 a(n) = 2n(1 + n + n^2 + n^3) - 3.