A255185 -id:A255185 - cp's OEIS frontend

A139600 Square array T(n,k) = n(k-1)k/2+k, of nonnegative numbers together with polygonal numbers, read by antidiagonals upwards.

0, 0, 1, 0, 1, 2, 0, 1, 3, 3, 0, 1, 4, 6, 4, 0, 1, 5, 9, 10, 5, 0, 1, 6, 12, 16, 15, 6, 0, 1, 7, 15, 22, 25, 21, 7, 0, 1, 8, 18, 28, 35, 36, 28, 8, 0, 1, 9, 21, 34, 45, 51, 49, 36, 9, 0, 1, 10, 24, 40, 55, 66, 70, 64, 45, 10, 0, 1, 11, 27, 46, 65, 81, 91, 92, 81, 55, 11

Offset: 0

Omar E. Pol, Apr 27 2008

A general formula for polygonal numbers is P(n,k) = (n-2)*(k-1)*k/2 + k, where P(n,k) is the k-th n-gonal number.

The triangle sums, see A180662 for their definitions, link this square array read by antidiagonals with twelve different sequences, see the crossrefs. Most triangle sums are linear sums of shifted combinations of a sequence, see e.g. A189374. - Johannes W. Meijer, Apr 29 2011

			The square array of nonnegatives together with polygonal numbers begins:
=========================================================
....................... A   A   .   .   A    A    A    A
....................... 0   0   .   .   0    0    1    1
....................... 0   0   .   .   1    1    3    3
....................... 0   0   .   .   6    7    9    9
....................... 0   0   .   .   9    3    6    6
....................... 0   1   .   .   5    2    0    0
....................... 4   2   .   .   7    9    6    7
=========================================================
Nonnegatives . A001477: 0,  1,  2,  3,  4,   5,   6,   7, ...
Triangulars .. A000217: 0,  1,  3,  6, 10,  15,  21,  28, ...
Squares ...... A000290: 0,  1,  4,  9, 16,  25,  36,  49, ...
Pentagonals .. A000326: 0,  1,  5, 12, 22,  35,  51,  70, ...
Hexagonals ... A000384: 0,  1,  6, 15, 28,  45,  66,  91, ...
Heptagonals .. A000566: 0,  1,  7, 18, 34,  55,  81, 112, ...
Octagonals ... A000567: 0,  1,  8, 21, 40,  65,  96, 133, ...
9-gonals ..... A001106: 0,  1,  9, 24, 46,  75, 111, 154, ...
10-gonals .... A001107: 0,  1, 10, 27, 52,  85, 126, 175, ...
11-gonals .... A051682: 0,  1, 11, 30, 58,  95, 141, 196, ...
12-gonals .... A051624: 0,  1, 12, 33, 64, 105, 156, 217, ...
...
=========================================================
The column with the numbers 2, 3, 4, 5, 6, ... is formed by the numbers > 1 of A000027. The column with the numbers 3, 6, 9, 12, 15, ... is formed by the positive members of A008585.

Alois P. Heinz, Rows n = 0..140, flattened
Peter Luschny, Figurate number — a very short introduction. With plots from Stefan Friedrich Birkner.
Omar E. Pol, Polygonal numbers, An alternative illustration of initial terms.
Index to sequences related to polygonal numbers

Cf. A001477, A057145, A139601, A139617, A139618, A139620, A180662.
A formal extension negative n is in A326728.
Triangle sums (see the comments): A055795 (Row1), A080956 (Row2; terms doubled), A096338 (Kn11, Kn12, Kn13, Fi1, Ze1), A002624 (Kn21, Kn22, Kn23, Fi2, Ze2), A000332 (Kn3, Ca3, Gi3), A134393 (Kn4), A189374 (Ca1, Ze3), A011779 (Ca2, Ze4), A101357 (Ca4), A189375 (Gi1), A189376 (Gi2), A006484 (Gi4). - Johannes W. Meijer, Apr 29 2011
Sequences of m-gonal numbers: A000217 (m=3), A000290 (m=4), A000326 (m=5), A000384 (m=6), A000566 (m=7), A000567 (m=8), A001106 (m=9), A001107 (m=10), A051682 (m=11), A051624 (m=12), A051865 (m=13), A051866 (m=14), A051867 (m=15), A051868 (m=16), A051869 (m=17), A051870 (m=18), A051871 (m=19), A051872 (m=20), A051873 (m=21), A051874 (m=22), A051875 (m=23), A051876 (m=24), A255184 (m=25), A255185 (m=26), A255186 (m=27), A161935 (m=28), A255187 (m=29), A254474 (m=30).

T:= func< n,k | k*(n*(k-1)+2)/2 >;
A139600:= func< n,k | T(n-k, k) >;
[A139600(n,k): k in  [0..n], n in [0..12]]; // G. C. Greubel, Jul 12 2024

T:= (n, k)-> n*(k-1)*k/2+k:
seq(seq(T(d-k, k), k=0..d), d=0..14);  # Alois P. Heinz, Oct 14 2018

T[n_, k_] := (n + 1)*(k - 1)*k/2 + k; Table[T[n - k - 1, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Robert G. Wilson v, Jul 12 2009 *)

def A139600Row(n):
    x, y = 1, 1
    yield 0
    while True:
        yield x
        x, y = x + y + n, y + n
for n in range(8):
    R = A139600Row(n)
    print([next(R) for  in range(11)]) # _Peter Luschny, Aug 04 2019

def T(n,k): return k*(n*(k-1)+2)/2
def A139600(n,k): return T(n-k, k)
flatten([[A139600(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Jul 12 2024

T(n,k) = n*(k-1)*k/2+k.
T(n,k) = A057145(n+2,k). - R. J. Mathar, Jul 28 2016
From Stefano Spezia, Apr 12 2024: (Start)
G.f.: y*(1 - x - y + 2*x*y)/((1 - x)^2*(1 - y)^3).
E.g.f.: exp(x+y)*y*(2 + x*y)/2. (End)

Edited by Omar E. Pol, Jan 05 2009

A316724 Generalized 26-gonal (or icosihexagonal) numbers: m(12m - 11) with m = 0, +1, -1, +2, -2, +3, -3, ...

Original entry on oeis.org

0, 1, 23, 26, 70, 75, 141, 148, 236, 245, 355, 366, 498, 511, 665, 680, 856, 873, 1071, 1090, 1310, 1331, 1573, 1596, 1860, 1885, 2171, 2198, 2506, 2535, 2865, 2896, 3248, 3281, 3655, 3690, 4086, 4123, 4541, 4580, 5020, 5061, 5523, 5566, 6050, 6095, 6601, 6648, 7176, 7225, 7775

Offset: 0

Omar E. Pol, Jul 11 2018

48*a(n) + 121 is a square. - Bruno Berselli, Jul 11 2018

Partial sums of A317322. - Omar E. Pol, Jul 28 2018

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

Cf. A255185, A317322.

Sequences of generalized k-gonal numbers: A001318 (k=5), A000217 (k=6), A085787 (k=7), A001082 (k=8), A118277 (k=9), A074377 (k=10), A195160 (k=11), A195162 (k=12), A195313 (k=13), A195818 (k=14), A277082 (k=15), A274978 (k=16), A303305 (k=17), A274979 (k=18), A303813 (k=19), A218864 (k=20), A303298 (k=21), A303299 (k=22), A303303 (k=23), A303814 (k=24), A303304 (k=25), this sequence (k=26), A316725 (k=27), A303812 (k=28), A303815 (k=29), A316729 (k=30).

[(12*n*(n+1) + 5*(-1)^n*(2*n+1) -5)/4: n in [0..60]]; // G. C. Greubel, Sep 24 2024

Table[(12 n (n + 1) + 5 (2 n + 1) (-1)^n - 5)/4, {n, 0, 60}] (* Bruno Berselli, Jul 11 2018 *)
CoefficientList[ Series[-x (x^2 + 22x + 1)/((x - 1)^3 (x + 1)^2), {x, 0, 60}], x] (* or *)
LinearRecurrence[{1, 2, -2, -1, 1}, {0, 1, 23, 26, 70}, 60] (* Robert G. Wilson v, Jul 28 2018 *)
nn=30; Sort[Table[n (12 n - 11), {n, -nn, nn}]] (* Vincenzo Librandi, Jul 29 2018 *)

concat(0, Vec(x*(1 + 22*x + x^2)/((1 + x)^2*(1 - x)^3) + O(x^60))) \\ Colin Barker, Jul 12 2018

[(12*n*(n+1) + 5*(-1)^n*(2*n+1) -5)//4 for n in range(61)] # G. C. Greubel, Sep 24 2024

From Bruno Berselli, Jul 11 2018: (Start)
O.g.f.: x*(1 + 22*x + x^2)/((1 + x)^2*(1 - x)^3).
a(n) = a(-1-n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5).
a(n) = (12*n*(n + 1) + 5*(2*n + 1)*(-1)^n - 5)/4. Therefore:
a(n) = n*(6*n + 11)/2 for n even; otherwise, a(n) = (n + 1)*(6*n - 5)/2.
(2*n - 1)*a(n) + (2*n + 1)*a(n-1) - n*(12*n^2 - 11) = 0. (End)
From Amiram Eldar, Mar 01 2022: (Start)
Sum_{n>=1} 1/a(n) = 12/121 + (sqrt(3)+2)*Pi/11.
Sum_{n>=1} (-1)^(n+1)/a(n) = (2*sqrt(3)*log(sqrt(3)+2) + 6*log(2) + 3*log(3))/11 - 12/121. (End)
E.g.f.: (1/4)*(5*(1 - 2*x)*exp(-x) + (-5 + 24*x + 12*x^2)*exp(x)). - G. C. Greubel, Sep 24 2024

A139601 Square array of polygonal numbers read by ascending antidiagonals: T(n, k) = (n + 1)(k - 1)k/2 + k.

Original entry on oeis.org

0, 0, 1, 0, 1, 3, 0, 1, 4, 6, 0, 1, 5, 9, 10, 0, 1, 6, 12, 16, 15, 0, 1, 7, 15, 22, 25, 21, 0, 1, 8, 18, 28, 35, 36, 28, 0, 1, 9, 21, 34, 45, 51, 49, 36, 0, 1, 10, 24, 40, 55, 66, 70, 64, 45, 0, 1, 11, 27, 46, 65, 81, 91, 92, 81, 55, 0, 1, 12, 30, 52, 75, 96, 112, 120, 117, 100, 66

Offset: 0

Omar E. Pol, Apr 27 2008

A general formula for polygonal numbers is P(n,k) = (n-2)(k-1)k/2 + k, where P(n,k) is the k-th n-gonal number. - Omar E. Pol, Dec 21 2008

			The square array of polygonal numbers begins:
========================================================
Triangulars .. A000217: 0, 1,  3,  6, 10,  15,  21,  28,
Squares ...... A000290: 0, 1,  4,  9, 16,  25,  36,  49,
Pentagonals .. A000326: 0, 1,  5, 12, 22,  35,  51,  70,
Hexagonals ... A000384: 0, 1,  6, 15, 28,  45,  66,  91,
Heptagonals .. A000566: 0, 1,  7, 18, 34,  55,  81, 112,
Octagonals ... A000567: 0, 1,  8, 21, 40,  65,  96, 133,
9-gonals ..... A001106: 0, 1,  9, 24, 46,  75, 111, 154,
10-gonals .... A001107: 0, 1, 10, 27, 52,  85, 126, 175,
11-gonals .... A051682: 0, 1, 11, 30, 58,  95, 141, 196,
12-gonals .... A051624: 0, 1, 12, 33, 64, 105, 156, 217,
And so on ..............................................
========================================================

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Peter Luschny, Figurate number — a very short introduction. With plots from Stefan Friedrich Birkner.
Omar E. Pol, Polygonal numbers, An alternative illustration of initial terms.

Sequences of m-gonal numbers: A000217 (m=3), A000290 (m=4), A000326 (m=5), A000384 (m=6), A000566 (m=7), A000567 (m=8), A001106 (m=9), A001107 (m=10), A051682 (m=11), A051624 (m=12), A051865 (m=13), A051866 (m=14), A051867 (m=15), A051868 (m=16), A051869 (m=17), A051870 (m=18), A051871 (m=19), A051872 (m=20), A051873 (m=21), A051874 (m=22), A051875 (m=23), A051876 (m=24), A255184 (m=25), A255185 (m=26), A255186 (m=27), A161935 (m=28), A255187 (m=29), A254474 (m=30).
Cf. A000007, A000012, A000027, A002411, A006000, A006003, A006522.
Cf. A008585, A016957, A017329, A086270, A117142, A139606, A139607.
Cf. A139608, A139609, A139610, A139611, A139612, A139613, A139614.
Cf. A139615, A139616, A057145, A086271, A139600, A139617, A139618.
Cf. A139619, A139620.

T:= func< n,k | k*((n+1)*(k-1) +2)/2 >;
A139601:= func< n,k | T(n-k, k) >;
[A139601(n,k): k in  [0..n], n in [0..12]]; // G. C. Greubel, Jul 12 2024

T[n_, k_] := (n + 1)*(k - 1)*k/2 + k; Table[ T[n - k, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Robert G. Wilson v, Jul 12 2009 *)

def T(n,k): return k*((n+1)*(k-1)+2)/2
def A139601(n,k): return T(n-k, k)
flatten([[A139601(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Jul 12 2024

T(n,k) = A086270(n,k), k>0. - R. J. Mathar, Aug 06 2008
T(n,k) = (n+1)*(k-1)*k/2 +k, n>=0, k>=0. - Omar E. Pol, Jan 07 2009
From G. C. Greubel, Jul 12 2024: (Start)
t(n, k) = (k/2)*( (k-1)*(n-k+1) + 2), where t(n,k) is this array read by rising antidiagonals.
t(2*n, n) = A006003(n).
t(2*n+1, n) = A002411(n).
t(2*n-1, n) = A006000(n-1).
Sum_{k=0..n} t(n, k) = A006522(n+2).
Sum_{k=0..n} (-1)^k*t(n, k) = (-1)^n * A117142(n).
Sum_{k=0..n} t(n-k, k) = (2*n^4 + 34*n^2 + 48*n - 15 + 3*(-1)^n*(2*n^2 + 16*n + 5))/384. (End)

A287326 Triangle read by rows: T(n, k) = 6k(n-k) + 1; n >= 0, 0 <= k <= n.

Original entry on oeis.org

1, 1, 1, 1, 7, 1, 1, 13, 13, 1, 1, 19, 25, 19, 1, 1, 25, 37, 37, 25, 1, 1, 31, 49, 55, 49, 31, 1, 1, 37, 61, 73, 73, 61, 37, 1, 1, 43, 73, 91, 97, 91, 73, 43, 1, 1, 49, 85, 109, 121, 121, 109, 85, 49, 1, 1, 55, 97, 127, 145, 151, 145, 127, 97, 55, 1, 1, 61, 109, 145, 169, 181, 181, 169, 145, 109, 61, 1

Offset: 0

Kolosov Petro, Aug 31 2017

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(1, n, k), i.e T(n, k) is partial case of L(m, n, k) for m = 1.
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
  ----------------------------------------
  n=0:  1;
  n=1:  1,  1;
  n=2:  1,  7,  1;
  n=3:  1, 13, 13,  1;
  n=4:  1, 19, 25, 19,  1;
  n=5:  1, 25, 37, 37, 25,  1;
  n=6:  1, 31, 49, 55, 49, 31,  1;
  n=7:  1, 37, 61, 73, 73, 61, 37,  1;
  n=8:  1, 43, 73, 91, 97, 91, 73, 43,  1;

Georg Fischer, Table of n, a(n) for n = 0..495 [rows 0..10 and 12..30 from Kolosov Petro]
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.

Columns k=0..6 give A000012, A016921, A017533, A161705, A103214, A128470, A158065.
Column sums k=0..4 give A000027, A000567, A051866, A051872, A255185.
Row sums give A001093.
Various cases of L(m, n, k): This sequence (m=1), A300656(m=2), A300785(m=3). See comments for L(m, n, k).
Differences of cubes n^3 are T(A000124(n), 1).
Cf. A000124, A000578, A003154, A003215, A007318, A008458, A016969.
Cf. A038593, A055012, A068601, A077028, A094053, A166873, A227776.
Cf. A294317, A302971, A304042.

Flat(List([0..11],n->List([0..n],k->6*k*(n-k)+1))); # Muniru A Asiru, Oct 09 2018

/* As triangle */ [[6*k*(n-k) + 1: k in [0..n]]: n in [0.. 15]]; // Vincenzo Librandi, Oct 26 2018

T := (n, k) -> 6*k*(n-k) + 1:
seq(seq(T(n, k), k=0..n), n=0..11); # Muniru A Asiru, Oct 09 2018

T[n_, k_] := 6 k (n - k) + 1; Column[Table[T[n, k], {n, 0, 10}, {k, 0, n}], Center] (* Kolosov Petro, Jun 02 2019 *)

t(n, k) = 6*k*(n-k)+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) \\ Felix Fröhlich, Jan 09 2018

def A287326(n,k): return 6*k*(n-k) + 1
flatten([[A287326(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Sep 25 2024

T(n, k) = 6*k*(n-k) + 1.
G.f. of column k: n^k*(1+(6*k-1)*n)/(1-n)^2.
G.f.: (1 - x - x*y + 7*x^2*y)/((1 - x)^2*(1 - x*y)^2). - Stefano Spezia, Oct 09 2018 [Adapted by Stefano Spezia, Sep 25 2024]
From Kolosov Petro, Jun 05 2019: (Start)
T(n, k) = 1/2 * T(A294317(n, k), k) + 1/2.
T(n+1, k) = 2*T(n, k) - T(n-1, k), for n >= k.
T(n, k) = 6*A077028(n, k) - 5.
T(2n, n) = A227776(n).
T(2n+1, n) = A003154(n+1).
T(2n+3, n) = A166873(n+1).
Sum_{k=0..n-1} T(n, k) = Sum_{k=1..n} T(n, k) = A000578(n).
Sum_{k=1..n-1} T(n, k) = A068601(n).
(n+1)^3 - n^3 = T(A000124(n), 1). (End)
Sum_{k=0..n} (-1)^k*T(n, k) = (-1/2)*(1 + (-1)^n)*A016969(floor(n/2) - 1). - G. C. Greubel, Sep 25 2024

A255184 25-gonal numbers: a(n) = n(23n-21)/2.

Original entry on oeis.org

0, 1, 25, 72, 142, 235, 351, 490, 652, 837, 1045, 1276, 1530, 1807, 2107, 2430, 2776, 3145, 3537, 3952, 4390, 4851, 5335, 5842, 6372, 6925, 7501, 8100, 8722, 9367, 10035, 10726, 11440, 12177, 12937, 13720, 14526, 15355, 16207, 17082, 17980

Offset: 0

Luciano Ancora, Apr 03 2015

If b(n,k) = n*((k-2)*n-(k-4))/2 is n-th k-gonal number, then b(n,k) = A000217(n) + (k-3)* A000217(n-1) (see Deza in References section, page 21, where the formula is attributed to Bachet de Méziriac).
Also, b(n,k) = b(n,k-1) + A000217(n-1) (see Deza and Picutti in References section, page 20 and 137 respectively, where the formula is attributed to Nicomachus). Some examples:
for k=4, A000290(n) = A000217(n) + A000217(n-1);
for k=5, A000326(n) = A000290(n) + A000217(n-1);
for k=6, A000384(n) = A000326(n) + A000217(n-1), etc.
This is the case k=25.

E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 6 (23rd row of the table).
E. Picutti, Sul numero e la sua storia, Feltrinelli Economica (1977), pages 131-147.

Luciano Ancora, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. k-gonal numbers: A000217 (k=3), A000290 (k=4), A000326 (k=5), A000384 (k=6), A000566 (k=7), A000567 (k=8), A001106 (k=9), A001107 (k=10), A051682 (k=11), A051624 (k=12), A051865 (k=13), A051866 (k=14), A051867 (k=15), A051868 (k=16), A051869 (k=17), A051870 (k=18), A051871 (k=19), A051872 (k=20), A051873 (k=21), A051874 (k=22), A051875 (k=23), A051876 (k=24), this sequence (k=25), A255185 (k=26), A255186 (k=27), A161935 (k=28), A255187 (k=29), A254474 (k=30).

k:=25; [n*((k-2)*n-(k-4))/2: n in [0..40]]; // Bruno Berselli, Apr 10 2015

Mathematica
```
Table[n (23 n - 21)/2, {n, 40}]
```

a(n)=n*(23*n-21)/2 \\ Charles R Greathouse IV, Oct 07 2015

G.f.: x*(-1 - 22*x)/(-1 + x)^3.
a(n) = A000217(n) + 22*A000217(n-1) = A051876(n) + A000217(n-1), see comments.
Product_{n>=2} (1 - 1/a(n)) = 23/25. - Amiram Eldar, Jan 22 2021
E.g.f.: exp(x)*(x + 23*x^2/2). - Nikolaos Pantelidis, Feb 05 2023

A103214 a(n) = 24*n + 1.

Original entry on oeis.org

1, 25, 49, 73, 97, 121, 145, 169, 193, 217, 241, 265, 289, 313, 337, 361, 385, 409, 433, 457, 481, 505, 529, 553, 577, 601, 625, 649, 673, 697, 721, 745, 769, 793, 817, 841, 865, 889, 913, 937, 961, 985, 1009, 1033, 1057, 1081, 1105, 1129, 1153, 1177, 1201

Offset: 0

Ralf Stephan, Jan 28 2005

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

Equals A008606 + 1. Bisection of A017533.

Cf. A255185.

[24*n+1: n in [0..60]]; // Vincenzo Librandi, Jun 15 2011

Range[1, 2000, 24] (* Vladimir Joseph Stephan Orlovsky, Jun 14 2011 *)

a(n)=24*n+1 \\ Charles R Greathouse IV, Jun 14 2011

From Elmo R. Oliveira, Mar 21 2024: (Start)
G.f.: (1+23*x)/(1-x)^2.
E.g.f.: exp(x)*(1 + 24*x).
a(n) = A255185(n+1) - A255185(n).
a(n) = 2*a(n-1) - a(n-2) for n >= 2. (End)

A317302 Square array T(n,k) = (n - 2)(k - 1)k/2 + k, with n >= 0, k >= 0, read by antidiagonals upwards.

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 0, 1, 1, -3, 0, 1, 2, 0, -8, 0, 1, 3, 3, -2, -15, 0, 1, 4, 6, 4, -5, -24, 0, 1, 5, 9, 10, 5, -9, -35, 0, 1, 6, 12, 16, 15, 6, -14, -48, 0, 1, 7, 15, 22, 25, 21, 7, -20, -63, 0, 1, 8, 18, 28, 35, 36, 28, 8, -27, -80, 0, 1, 9, 21, 34, 45, 51, 49, 36, 9, -35, -99, 0, 1, 10, 24, 40, 55, 66

Offset: 0

Omar E. Pol, Aug 09 2018

Note that the formula gives several kinds of numbers, for example:
Row 0 gives 0 together with A258837.
Row 1 gives 0 together with A080956.
Row 2 gives A001477, the nonnegative numbers.
For n >= 3, row n gives the n-gonal numbers (see Crossrefs section).

			Array begins:
------------------------------------------------------------------------
n\k  Numbers       Seq. No.   0   1   2   3   4    5    6    7    8
------------------------------------------------------------------------
0    ............ (A258837):  0,  1,  0, -3, -8, -15, -24, -35, -48, ...
1    ............ (A080956):  0,  1,  1,  0, -2,  -5,  -9, -14, -20, ...
2    Nonnegatives  A001477:   0,  1,  2,  3,  4,   5,   6,   7,   8, ...
3    Triangulars   A000217:   0,  1,  3,  6, 10,  15,  21,  28,  36, ...
4    Squares       A000290:   0,  1,  4,  9, 16,  25,  36,  49,  64, ...
5    Pentagonals   A000326:   0,  1,  5, 12, 22,  35,  51,  70,  92, ...
6    Hexagonals    A000384:   0,  1,  6, 15, 28,  45,  66,  91, 120, ...
7    Heptagonals   A000566:   0,  1,  7, 18, 34,  55,  81, 112, 148, ...
8    Octagonals    A000567:   0,  1,  8, 21, 40,  65,  96, 133, 176, ...
9    9-gonals      A001106:   0,  1,  9, 24, 46,  75, 111, 154, 204, ...
10   10-gonals     A001107:   0,  1, 10, 27, 52,  85, 126, 175, 232, ...
11   11-gonals     A051682:   0,  1, 11, 30, 58,  95, 141, 196, 260, ...
12   12-gonals     A051624:   0,  1, 12, 33, 64, 105, 156, 217, 288, ...
13   13-gonals     A051865:   0,  1, 13, 36, 70, 115, 171, 238, 316, ...
14   14-gonals     A051866:   0,  1, 14, 39, 76, 125, 186, 259, 344, ...
15   15-gonals     A051867:   0,  1, 15, 42, 82, 135, 201, 280, 372, ...
...

Omar E. Pol, Polygonal numbers.
The OEIS, Polygonal numbers.
University of Surrey, Dept. of Mathematics, Polygonal Numbers - or Numbers as Shapes.
Eric Weisstein's World of Mathematics, Figurate Number.
Eric Weisstein's World of Mathematics, Polygonal Number.
Wikipedia, Polygonal number.
Index to sequences related to polygonal numbers

Column 0 gives A000004.
Column 1 gives A000012.
Column 2 gives A001477, which coincides with the row numbers.
Main diagonal gives A060354.
Row 0 gives 0 together with A258837.
Row 1 gives 0 together with A080956.
Row 2 gives A001477, the same as column 2.
For n >= 3, row n gives the n-gonal numbers: A000217 (n=3), A000290 (n=4), A000326 (n=5), A000384 (n=6), A000566 (n=7), A000567 (n=8), A001106 (n=9), A001107 (n=10), A051682 (n=11), A051624 (n=12), A051865 (n=13), A051866 (n=14), A051867 (n=15), A051868 (n=16), A051869 (n=17), A051870 (n=18), A051871 (n=19), A051872 (n=20), A051873 (n=21), A051874 (n=22), A051875 (n=23), A051876 (n=24), A255184 (n=25), A255185 (n=26), A255186 (n=27), A161935 (n=28), A255187 (n=29), A254474 (n=30).
Cf. A139600, A139601.
Cf. A303301 (similar table but with generalized polygonal numbers).

T(n,k) = A139600(n-2,k) if n >= 2.

T(n,k) = A139601(n-3,k) if n >= 3.

A256646 26-gonal pyramidal numbers: a(n) = n(n+1)(8*n-7)/2.

Original entry on oeis.org

0, 1, 27, 102, 250, 495, 861, 1372, 2052, 2925, 4015, 5346, 6942, 8827, 11025, 13560, 16456, 19737, 23427, 27550, 32130, 37191, 42757, 48852, 55500, 62725, 70551, 79002, 88102, 97875, 108345, 119536, 131472, 144177, 157675, 171990, 187146, 203167, 220077

Offset: 0

Luciano Ancora, Apr 07 2015

See comments in A256645.

E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93 (24th row of the table).

Luciano Ancora, Table of n, a(n) for n = 0..1000
Luciano Ancora, Polygonal and Pyramidal numbers, Section 3.
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Partial sums of A255185.
Cf. similar sequences listed in A237616.
Cf. A000292, A051866, A256645.

[n*(n+1)*(8*n-7)/2: n in [0..50]]; // Vincenzo Librandi, Apr 08 2015

Table[n (n + 1) (8 n - 7)/2, {n, 0, 40}]
LinearRecurrence[{4, -6, 4, -1}, {0, 1, 27, 102}, 40] (* Vincenzo Librandi, Apr 08 2015 *)

[(8*n-7)*binomial(n+1,2) for n in range(51)] # G. C. Greubel, Jul 12 2024

G.f.: x*(1 + 23*x)/(1 - x)^4.
a(n) = A000292(n) + 23*A000292(n-1).
a(n) = n*A051866(n) - Sum_{i=0..n-1} A051866(i). - Bruno Berselli, Apr 09 2015
Sum_{n>=1} 1/a(n) = 2*(4*(sqrt(2)+1)*Pi - 4*(sqrt(2)-8)*log(2) + 8*sqrt(2)*log(sqrt(2)+2) - 7)/105. - Amiram Eldar, Jan 10 2022
E.g.f.: (1/2)*x*(2 + 25*x + 8*x^2)*exp(x). - G. C. Greubel, Jul 12 2024

A330892 Square array of polygonal numbers read by descending antidiagonals (the transpose of A317302).

Original entry on oeis.org

0, 1, 0, 0, 1, 0, -3, 1, 1, 0, -8, 0, 2, 1, 0, -15, -2, 3, 3, 1, 0, -24, -5, 4, 6, 4, 1, 0, -35, -9, 5, 10, 9, 5, 1, 0, -48, -14, 6, 15, 16, 12, 6, 1, 0, -63, -20, 7, 21, 25, 22, 15, 7, 1, 0, -80, -27, 8, 28, 36, 35, 28, 18, 8, 1, 0, -99, -35, 9, 36, 49, 51, 45, 34, 21, 9, 1, 0

Offset: 1

Robert G. Wilson v, Apr 27 2020

\c  0 1  2  3  4   5   6   7   8   9  10  11   12   13    14  15  ...
r\
_0  0 1  0 -3 -8 -15 -24 -35 -48 -63 -80 -99 -120 -143 -168 -195  A067998
_1  0 1  1  0 -2  -5  -9 -14 -20 -27 -35 -44  -54  -65  -77  -90  A080956
_2  0 1  2  3  4   5   6   7   8   9  10  11   12   13   14   15  A001477
_3  0 1  3  6 10  15  21  28  36  45  55  66   78   91  105  120  A000217
_4  0 1  4  9 16  25  36  49  64  81 100 121  144  169  196  225  A000290
_5  0 1  5 12 22  35  51  70  92 117 145 176  210  247  287  330  A000326
_6  0 1  6 15 28  45  66  91 120 153 190 231  276  325  378  435  A000384
_7  0 1  7 18 34  55  81 112 148 189 235 286  342  403  469  540  A000566
_8  0 1  8 21 40  65  96 133 176 225 280 341  408  481  560  645  A000567
_9  0 1  9 24 46  75 111 154 204 261 325 396  474  559  651  750  A001106
10  0 1 10 27 52  85 126 175 232 297 370 451  540  637  742  855  A001107
11  0 1 11 30 58  95 141 196 260 333 415 506  606  715  833  960  A051682
12  0 1 12 33 64 105 156 217 288 369 460 561  672  793  924 1065  A051624
13  0 1 13 36 70 115 171 238 316 405 505 616  738  871 1015 1170  A051865
14  0 1 14 39 76 125 186 259 344 441 550 671  804  949 1106 1275  A051866
15  0 1 15 42 82 135 201 280 372 477 595 726  870 1027 1197 1380  A051867
...
Each row has a second forward difference of (r-2) and each column has a forward difference of c(c-1)/2.

E. Deza and M. Deza, Figurate Numbers, World Scientific, 2012; see p. 45.
Eric Weisstein's World of Mathematics, Polygonal Number.
Wikipedia, Polygonal number.
Index to sequences related to polygonal numbers

Cf. A317302 (the same array) but read by ascending antidiagonals.
Sub-arrays: A089000, A139600, A206735;
Rows: A067998, A080956, A001477, A000217, A000290, A000326, A000384, A000566, A000567, A001106, A001107, A051682, A051624, A051865, A051866, A051867, A051868, A051869, A051870, A051871, A051872, A051873, A051874, A051875, A051876, A255184, A255185, A255186, A161935, A255187, A254474, ..., ;
Columns (maybe missing some leading terms): A000004, A000012, A001477, A008585, A016957, A017329, A139606, A139607, A139608, A139609, A139610, A139611, A139612, A139613, A139614, A139615, A139616, A139617, A139618, A139619, A139620;
Diagonals: A256857, A127736, A002411, A006003, A006000, A064808, A060354, A162607, A077414,
Number of times k>1 appears: A129654, First occurrence of k: A063778.

Table[ PolygonalNumber[r - c, c], {r, 0, 11}, {c, r, 0, -1}] // Flatten

P(r, c) = (r - 2)(c(c-1)/2) + c.

cp's OEIS Frontend

A139600 Square array T(n,k) = n*(k-1)*k/2+k, of nonnegative numbers together with polygonal numbers, read by antidiagonals upwards.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Python

SageMath

Formula

Extensions

A316724 Generalized 26-gonal (or icosihexagonal) numbers: m*(12*m - 11) with m = 0, +1, -1, +2, -2, +3, -3, ...

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A139601 Square array of polygonal numbers read by ascending antidiagonals: T(n, k) = (n + 1)*(k - 1)*k/2 + k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A287326 Triangle read by rows: T(n, k) = 6*k*(n-k) + 1; n >= 0, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

SageMath

Formula

A255184 25-gonal numbers: a(n) = n*(23*n-21)/2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A103214 a(n) = 24*n + 1.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

A139600 Square array T(n,k) = n(k-1)k/2+k, of nonnegative numbers together with polygonal numbers, read by antidiagonals upwards.

A316724 Generalized 26-gonal (or icosihexagonal) numbers: m(12m - 11) with m = 0, +1, -1, +2, -2, +3, -3, ...

A139601 Square array of polygonal numbers read by ascending antidiagonals: T(n, k) = (n + 1)(k - 1)k/2 + k.

A287326 Triangle read by rows: T(n, k) = 6k(n-k) + 1; n >= 0, 0 <= k <= n.

A255184 25-gonal numbers: a(n) = n(23n-21)/2.

A317302 Square array T(n,k) = (n - 2)(k - 1)k/2 + k, with n >= 0, k >= 0, read by antidiagonals upwards.

A256646 26-gonal pyramidal numbers: a(n) = n(n+1)(8*n-7)/2.