A051682 -id:A051682 - cp's OEIS frontend

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

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)

A038764 a(n) = (9n^2 + 3n + 2)/2.

Original entry on oeis.org

1, 7, 22, 46, 79, 121, 172, 232, 301, 379, 466, 562, 667, 781, 904, 1036, 1177, 1327, 1486, 1654, 1831, 2017, 2212, 2416, 2629, 2851, 3082, 3322, 3571, 3829, 4096, 4372, 4657, 4951, 5254, 5566, 5887, 6217, 6556, 6904, 7261, 7627, 8002, 8386, 8779, 9181

Offset: 0

N. J. A. Sloane, May 03 2000

Coefficients of x^2 of certain rook polynomials (for n>=1; see p. 18 of the Riordan paper). - Emeric Deutsch, Mar 08 2004

a(n) is also the least weight of self-conjugate partitions having n+1 different parts such that each part is congruent to 1 modulo 3. The first such self-conjugate partitions, corresponding to a(n) = 0, 1, 2, 3, are 1, 4+3, 7+4+4+4+3, 10+7+7+7+4+4+4+3. - Augustine O. Munagi, Dec 18 2008

J. Riordan, Discordant permutations, Scripta Math., 20 (1954), 14-23.

Colin Barker, Table of n, a(n) for n = 0..1000
S. J. Cyvin, B. N. Cyvin, and J. Brunvoll, Unbranched catacondensed polygonal systems containing hexagons and tetragons, Croatica Chem. Acta, 69 (1996), 757-774.
A. O. Munagi, Pairing conjugate partitions by residue classes, Discrete Math., 308 (2008), 2492-2501.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Reflection of A060544 in A081272.
Second column of A024462. Also = A064641(n+1, 2).
Shallow diagonal of triangular spiral in A051682.
Cf. A027468, A080855, A283394.
Partial sums of A122709.

LinearRecurrence[{3, -3, 1}, {1, 7, 22}, 50] (* Paolo Xausa, Jul 03 2025 *)

a(n)=n*(9*n+3)/2+1 \\ Charles R Greathouse IV, Jun 17 2017

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

a = lambda n: hypergeometric([-n, -2], [1], 3)
print([simplify(a(n)) for n in range(46)]) # Peter Luschny, Nov 19 2014

a(n) = binomial(n,0) + 6*binomial(n,1) + 9*binomial(n,2).
From Paul Barry, Mar 15 2003: (Start)
G.f.: (1 + 2*x)^2/(1 - x)^3.
Binomial transform of (1, 6, 9, 0, 0, 0, ...). (End)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2. -  Colin Barker, Jan 22 2018
a(n) = a(n-1) + 3*(3*n-1) for n>0, a(0)=1. - Vincenzo Librandi, Nov 17 2010
a(n) = hypergeometric([-n, -2], [1], 3). - Peter Luschny, Nov 19 2014
E.g.f.: exp(x)*(2 + 12*x + 9*x^2)/2. - Stefano Spezia, Mar 07 2023

More terms from James Sellers, May 03 2000

Entry revised by N. J. A. Sloane, Jan 23 2018

A062728 Second 11-gonal (or hendecagonal) numbers: a(n) = n(9n+7)/2.

Original entry on oeis.org

0, 8, 25, 51, 86, 130, 183, 245, 316, 396, 485, 583, 690, 806, 931, 1065, 1208, 1360, 1521, 1691, 1870, 2058, 2255, 2461, 2676, 2900, 3133, 3375, 3626, 3886, 4155, 4433, 4720, 5016, 5321, 5635, 5958, 6290, 6631, 6981, 7340, 7708, 8085, 8471, 8866, 9270

Offset: 0

Floor van Lamoen, Jul 21 2001

Old name: Write 0,1,2,3,4,... in a triangular spiral, then a(n) is the sequence found by reading the line from 0 in the direction 0,8,...

Sequence found by reading the line from 0, in the direction 0, 25, ... and the line from 8, in the direction 8, 51, ..., in the square spiral whose vertices are the generalized 11-gonal numbers A195160. - Omar E. Pol, Jul 24 2012

			The spiral begins:
          15
          / \
        16  14
        /     \
      17   3  13
      /   / \   \
    18   4   2  12
    /   /     \   \
  19   5   0---1  11
  /   /             \
20   6---7---8---9--10

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

Cf. A051682.

Second n-gonal numbers: A005449, A014105, A147875, A045944, A179986, A033954, this sequence, A135705.

List([0..50], n-> n*(9*n+7)/2); # G. C. Greubel, May 24 2019

[n*(9*n+7)/2: n in [0..50]]; // G. C. Greubel, May 24 2019

Table[n*(9*n+7)/2, {n,0,50}] (* G. C. Greubel, May 24 2019 *)
LinearRecurrence[{3,-3,1},{0,8,25},50] (* Harvey P. Dale, Sep 06 2019 *)

a(n)=n*(9*n+7)/2 \\ Charles R Greathouse IV, Jun 17 2017

[n*(9*n+7)/2 for n in (0..50)] # G. C. Greubel, May 24 2019

a(n) = n*(9*n+7)/2.
a(n) = 9*n + a(n-1) - 1 (with a(0)=0). - Vincenzo Librandi, Aug 07 2010
From Bruno Berselli, Jan 13 2011: (Start)
G.f.: x*(8 + x)/(1 - x)^3.
a(n) = Sum_{i=0..n-1} A017257(i) for n > 0. (End)
a(n) = A218470(9n+7). - Philippe Deléham, Mar 27 2013
E.g.f.: x*(16 + 9*x)*exp(x)/2. - G. C. Greubel, May 24 2019

New name from Bruno Berselli (with the original formula), Jan 13 2011

A218470 Partial sums of floor(n/9).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 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

Offset: 0

Philippe Deléham, Mar 26 2013

Apart from the initial zeros, the same as A008727.

			As square array:
..0....0....0....0....0....0....0....0....0....
..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....
...

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

Cf. similar sequences: A118729, A174109, A174738.

[&+[Floor(k/9): k in [0..n]]: n in [0..70]]; // Bruno Berselli, Mar 27 2013

Accumulate[Floor[Range[0, 100]/9]] (* Jean-François Alcover, Mar 27 2013 *)

for(n=0,50, print1(sum(k=0,n, floor(k/9)), ", ")) \\ G. C. Greubel, Dec 13 2016

a(n)=my(k=n\9); k*(9*k-7)/2 + k*(n-9*k) \\ Charles R Greathouse IV, Dec 13 2016

a(9n)   = A051682(n).
a(9n+1) = A062708(n).
a(9n+2) = A062741(n).
a(9n+3) = A022266(n).
a(9n+4) = A022267(n).
a(9n+5) = A081266(n).
a(9n+6) = A062725(n).
a(9n+7) = A062728(n).
a(9n+8) = A027468(n).
G.f.: x^9/((1-x)^2*(1-x^9)). - Bruno Berselli, Mar 27 2013

A022266 a(n) = n(9n - 1)/2.

Original entry on oeis.org

0, 4, 17, 39, 70, 110, 159, 217, 284, 360, 445, 539, 642, 754, 875, 1005, 1144, 1292, 1449, 1615, 1790, 1974, 2167, 2369, 2580, 2800, 3029, 3267, 3514, 3770, 4035, 4309, 4592, 4884, 5185, 5495, 5814, 6142, 6479, 6825, 7180, 7544, 7917, 8299, 8690, 9090, 9499

Offset: 0

N. J. A. Sloane

From Floor van Lamoen, Jul 21 2001: (Start)
Write 0,1,2,3,4,... in a triangular spiral, then a(n) is the sequence found by reading the line from 0 in the direction 0,4,...
The spiral begins:
            15
            / \
          16  14
          /     \
        17   3  13
        /   / \   \
      18   4   2  12
      /   /     \   \
    19   5   0---1  11
    /   /             \
  20   6---7---8---9--10
(End)
a(n) with n>0 are the numbers with period length 3 in Bulgarian and Mancala solitaire. - Paul Weisenhorn Jan 29 2022

G. C. Greubel, Table of n, a(n) for n = 0..5000
Amelia Carolina Sparavigna, The groupoids of Mersenne, Fermat, Cullen, Woodall and other Numbers and their representations by means of integer sequences, Politecnico di Torino, Italy (2019), [math.NT].
Amelia Carolina Sparavigna, The groupoid of the Triangular Numbers and the generation of related integer sequences, Politecnico di Torino, Italy (2019).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A000326, A022267, A049452, A051682, A218470, A235332.

Cf. similar sequences listed in A022288.

[n*(9*n-1)/2 : n in [0..50]]; // Wesley Ivan Hurt, Dec 04 2016

[seq(binomial(9*n,2)/9, n=0..37)]; # Zerinvary Lajos, Jan 02 2007
seq(n*(6*n-1)-n*(3*n-1)/2, n=0..37); # Zerinvary Lajos, Jun 12 2007

Table[n (9 n - 1)/2, {n, 0, 40}] (* Bruno Berselli, Oct 17 2016 *)
LinearRecurrence[{3,-3,1},{0,4,17},50] (* Harvey P. Dale, Aug 06 2023 *)

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

a(n) = binomial(9*n,2)/9 for n >= 0. - Zerinvary Lajos, Jan 02 2007
a(n) = A049452(n) - A000326(n). - Zerinvary Lajos, Jun 12 2007
a(n) = 9*n + a(n-1) - 5 for n > 0, a(0)=0. - Vincenzo Librandi, Aug 04 2010
G.f.: x*(4 + 5*x)/(1 - x)^3. - Colin Barker, Feb 14 2012
a(n) = A218470(9*n+3). - Philippe Deléham, Mar 27 2013
a(n) = A000217(5*n-1) - A000217(4*n-1). - Bruno Berselli, Oct 17 2016
From Wesley Ivan Hurt, Dec 04 2016: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2.
a(n) = (1/7) * Sum_{i=n..(8*n-1)} i. (End)
E.g.f.: (x/2)*(9*x + 8)*exp(x). - G. C. Greubel, Aug 24 2017
a(n) = A000326(3*n) / 3. - Joerg Arndt, May 04 2021

A226492 a(n) = n(11n-5)/2.

Original entry on oeis.org

0, 3, 17, 42, 78, 125, 183, 252, 332, 423, 525, 638, 762, 897, 1043, 1200, 1368, 1547, 1737, 1938, 2150, 2373, 2607, 2852, 3108, 3375, 3653, 3942, 4242, 4553, 4875, 5208, 5552, 5907, 6273, 6650, 7038, 7437, 7847, 8268, 8700, 9143, 9597, 10062, 10538, 11025, 11523

Offset: 0

Bruno Berselli, Jun 11 2013

Sequences of numbers of the form n*(n*k - k + 6)/2:
. k from 0 to 10, respectively: A008585, A055998, A005563, A045943, A014105, A005475, A033428, A022264, A033991, A062741, A147874;
. k=11: a(n);
. k=12: A094159;
. k=13: 0, 3, 19, 48, 90, 145, 213, 294, 388, 495, 615, 748, 894, ...;
. k=14: 0, 3, 20, 51, 96, 155, 228, 315, 416, 531, 660, 803, 960, ...;
. k=15: A152773;
. k=16: A139272;
. k=17: 0, 3, 23, 60, 114, 185, 273, 378, 500, 639, 795, 968, ...;
. k=18: A152751;
. k=19: 0, 3, 25, 66, 126, 205, 303, 420, 556, 711, 885, 1078, ...;
. k=20: 0, 3, 26, 69, 132, 215, 318, 441, 584, 747, 930, 1133, ...;
. k=21: A152759;
. k=22: 0, 3, 28, 75, 144, 235, 348, 483, 640, 819, 1020, 1243, ...;
. k=23: 0, 3, 29, 78, 150, 245, 363, 504, 668, 855, 1065, 1298, ...;
. k=24: A152767;
. k=25: 0, 3, 31, 84, 162, 265, 393, 546, 724, 927, 1155, 1408, ...;
. k=26: 0, 3, 32, 87, 168, 275, 408, 567, 752, 963, 1200, 1463, ...;
. k=27: A153783;
. k=28: A195021;
. k=29: 0, 3, 35, 96, 186, 305, 453, 630, 836, 1071, 1335, 1628, ...;
. k=30: A153448;
. k=31: 0, 3, 37, 102, 198, 325, 483, 672, 892, 1143, 1425, 1738, ...;
. k=32: 0, 3, 38, 105, 204, 335, 498, 693, 920, 1179, 1470, 1793, ...;
. k=33: A153875.
Also:
a(n) - n         = A180223(n);
a(n) + n         = n*(11*n-3)/2 = 0, 4, 19, 45, 82, 130, 189, 259, ...;
a(n) - 2*n       = A051865(n);
a(n) + 2*n       = A022268(n);
a(n) - 3*n       = A152740(n-1);
a(n) + 3*n       = A022269(n);
a(n) - 4*n       = n*(11*n-13)/2 = 0, -1, 9, 30, 62, 105, 159, 224, ...;
a(n) + 4*n       = A254963(n);
a(n) - n*(n-1)/2 = A147874(n+1);
a(n) + n*(n-1)/2 = A094159(n) (case k=12);
a(n) - n*(n-1)   = A062741(n) (see above, this is the case k=9);
a(n) + n*(n-1)   = n*(13*n-7)/2 (case k=13);
a(n) - n*(n+1)/2 = A135706(n);
a(n) + n*(n+1)/2 = A033579(n);
a(n) - n*(n+1)   = A051682(n);
a(n) + n*(n+1)   = A186030(n);
a(n) - n^2       = A062708(n);
a(n) + n^2       = n*(13*n-5)/2 = 0, 4, 21, 51, 94, 150, 219, ..., etc.
Sum of reciprocals of a(n), for n > 0: 0.47118857003113149692081665034891...

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

Cf. sequences in Comments lines.
First differences are in A017425.
Cf. A033584, A180223.

Magma
```
[n*(11*n-5)/2: n in [0..50]];
```

I:=[0,3,17]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..46]]; // Vincenzo Librandi, Aug 18 2013

Table[n (11 n - 5)/2, {n, 0, 50}]
CoefficientList[Series[x (3 + 8 x) / (1 - x)^3, {x, 0, 45}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{3,-3,1},{0,3,17},50] (* Harvey P. Dale, Jan 14 2019 *)

a(n)=n*(11*n-5)/2 \\ Charles R Greathouse IV, Sep 24 2015

G.f.: x*(3+8*x)/(1-x)^3.
a(n) + a(-n) = A033584(n).
From Elmo R. Oliveira, Dec 27 2024: (Start)
E.g.f.: exp(x)*x*(6 + 11*x)/2.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2.
a(n) = n + A180223(n). (End)

A051868 16-gonal (or hexadecagonal) numbers: a(n) = n(7n-6).

Original entry on oeis.org

0, 1, 16, 45, 88, 145, 216, 301, 400, 513, 640, 781, 936, 1105, 1288, 1485, 1696, 1921, 2160, 2413, 2680, 2961, 3256, 3565, 3888, 4225, 4576, 4941, 5320, 5713, 6120, 6541, 6976, 7425, 7888, 8365, 8856, 9361, 9880, 10413, 10960, 11521

Offset: 0

N. J. A. Sloane, Dec 15 1999

Sequence found by reading the line from 0, in the direction 0, 16, ... and the parallel line from 1, in the direction 1, 45, ..., in the square spiral whose vertices are the generalized 16-gonal numbers. - Omar E. Pol, Jul 18 2012
This is also a star octagonal number: a(n) = A000567(n) + 8*A000217(n-1). - Luciano Ancora, Mar 29 2015
Let T(n) = A000217(n), the n-th triangular number. Then a(n) = T(n-1) + T(4n-3) - T(2n-4) + T(n-3).  In general, let P(k,n) be the n-th k-gonal number. Then for k>1, P(T(k)+1,n) = T(n-1) + T((k-1)n-(k-2)) - T((k-3)n-2(k-3)) + T((k-4)n-3(k-4)) - ... + (-1)^(k+1)*T(n-(k-2)). - Charlie Marion, Dec 23 2019

Albert H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, p. 189.
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 6.

Ivan Panchenko, Table of n, a(n) for n = 0..1000
John Elias, Illustration: 16-gonal Star Configuration
Index to sequences related to polygonal numbers
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000290, A000566, A051682, A051874, A255187, A282852.

Table[n(7n-6),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,1,16}, 51] (*  Harvey P. Dale, May 07 2011 *)

a(n)=n*(7*n-6) \\ Charles R Greathouse IV, Jan 24 2014

a(n) = 14*n + a(n-1) - 13, with n>0, a(0)=0. - Vincenzo Librandi, Aug 06 2010
G.f.: x*(1+13*x)/(1-x)^3. - Bruno Berselli, Feb 04 2011
a(0)=0, a(1)=1, a(2)=16; for n>2, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, May 07 2011
a(14*a(n) + 92*n + 1) = a(14*a(n) + 92*n) + a(14*n+1). - Vladimir Shevelev, Jan 24 2014
E.g.f.: exp(x)*x*(1 + 7*x). - Stefano Spezia, Dec 27 2019
a(n) = (4*n-3)^2 - (3*n-3)^2. In general, if we let P(k,n) be the n-th k-gonal number, then P(4k,n) = (k*n-k+1)^2 - ((k-1)*n-k+1)^2. In addition, {P(4k,n)} are the only polygonal number sequences each of whose terms can be written as the difference of two squares. - Charlie Marion, Feb 16 2020
Product_{n>=2} (1 - 1/a(n)) = 7/8. - Amiram Eldar, Jan 22 2021

A220212 Convolution of natural numbers (A000027) with tetradecagonal numbers (A051866).

Original entry on oeis.org

0, 1, 16, 70, 200, 455, 896, 1596, 2640, 4125, 6160, 8866, 12376, 16835, 22400, 29240, 37536, 47481, 59280, 73150, 89320, 108031, 129536, 154100, 182000, 213525, 248976, 288666, 332920, 382075, 436480, 496496, 562496, 634865, 714000, 800310, 894216, 996151

Offset: 0

Bruno Berselli, Dec 08 2012

Partial sums of A172073.

Apart from 0, all terms are in A135021: a(n) = A135021(A034856(n+1)) with n>0.

Bruno Berselli, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
Index to sequences related to pyramidal numbers.

Cf. A135021, A172073.
Cf. convolution of the natural numbers (A000027) with the k-gonal numbers (* means "except 0"):
k= 2 (A000027 ): A000292;
k= 3 (A000217 ): A000332 (after the third term);
k= 4 (A000290 ): A002415 (after the first term);
k= 5 (A000326 ): A001296;
k= 6 (A000384*): A002417;
k= 7 (A000566 ): A002418;
k= 8 (A000567*): A002419;
k= 9 (A001106*): A051740;
k=10 (A001107*): A051797;
k=11 (A051682*): A051798;
k=12 (A051624*): A051799;
k=13 (A051865*): A055268.
Cf. similar sequences with formula n*(n+1)*(n+2)*(k*n-k+2)/12 listed in A264850.

A051866:=func; [&+[(n-k+1)*A051866(k): k in [0..n]]: n in [0..37]];

I:=[0,1,16,70,200]; [n le 5 select I[n] else 5*Self(n-1)-10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+Self(n-5): n in [1..50]]; // Vincenzo Librandi, Aug 18 2013

A051866[k_] := k (6 k - 5); Table[Sum[(n - k + 1) A051866[k], {k, 0, n}], {n, 0, 37}]
CoefficientList[Series[x (1 + 11 x) / (1 - x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, Aug 18 2013 *)

G.f.: x*(1+11*x)/(1-x)^5.
a(n) = n*(n+1)*(n+2)*(3*n-2)/6.
From Amiram Eldar, Feb 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 3*(3*sqrt(3)*Pi + 27*log(3) - 17)/80.
Sum_{n>=1} (-1)^(n+1)/a(n) = 3*(6*sqrt(3)*Pi - 64*log(2) + 37)/80. (End)

A062708 Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,...

Original entry on oeis.org

0, 2, 13, 33, 62, 100, 147, 203, 268, 342, 425, 517, 618, 728, 847, 975, 1112, 1258, 1413, 1577, 1750, 1932, 2123, 2323, 2532, 2750, 2977, 3213, 3458, 3712, 3975, 4247, 4528, 4818, 5117, 5425, 5742, 6068, 6403, 6747, 7100, 7462, 7833, 8213, 8602, 9000

Offset: 0

Floor van Lamoen, Jul 21 2001

			The spiral begins:
.
            15
            / \
          16  14
          /     \
        17   3  13
        /   / \   \
      18   4   2  12
      /   /     \   \
    19   5   0---1  11
    /   /             \
  20   6---7---8---9--10
.
From _Vincenzo Librandi_, Aug 07 2010: (Start)
a(1) = 9*1 +  0 - 7 =  2;
a(2) = 9*2 +  2 - 7 = 13;
a(3) = 9*3 + 13 - 7 = 33. (End)

G. C. Greubel, Table of n, a(n) for n = 0..1000
Milan Janjic, Two Enumerative Functions [broken link]
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A051682.
Cf. A218470.
Cf. numbers of the form n*(n*k-k+4)/2 listed in A226488 (this is case k=9).

List([0..50], n-> n*(9*n-5)/2); # G. C. Greubel, Sep 02 2019

[n*(9*n-5)/2: n in [0..50]]; // G. C. Greubel, Sep 02 2019

seq(n*(9*n-5)/2, n=0..50); # G. C. Greubel, Sep 02 2019

Table[n*(9*n-5)/2, {n,0,50}] (* G. C. Greubel, Sep 02 2019 *)
nxt[{n_,a_}]:={n+1,9(n+1)+a-7}; NestList[nxt,{0,0},50][[All,2]] (* Harvey P. Dale, Apr 11 2022 *)

a(n)=n*(9*n-5)/2 \\ Charles R Greathouse IV, Jun 17 2017

[n*(9*n-5)/2 for n in (0..50)] # G. C. Greubel, Sep 02 2019

a(n) = n*(9*n-5)/2.
a(n) = 9*n + a(n-1) - 7 (with a(0)=0). - Vincenzo Librandi, Aug 07 2010
From Colin Barker, Jul 07 2012: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: x*(2+7*x)/(1-x)^3. (End)
a(n) = A218470(9n+1). - Philippe Deléham, Mar 27 2013
E.g.f.:  x*(4 + 9*x)*exp(x)/2. - G. C. Greubel, Sep 02 2019

A153783 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3n(9*n-7)/2.

Original entry on oeis.org

0, 3, 33, 90, 174, 285, 423, 588, 780, 999, 1245, 1518, 1818, 2145, 2499, 2880, 3288, 3723, 4185, 4674, 5190, 5733, 6303, 6900, 7524, 8175, 8853, 9558, 10290, 11049, 11835, 12648, 13488, 14355, 15249, 16170, 17118, 18093, 19095

Offset: 0

Omar E. Pol, Jan 02 2009

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

Cf. A051682, A152995.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152773, A152751, A152759, A152767, A153448, A153875.
Cf. numbers of the form n*(n*k-k+6)/2, this sequence is the case k=27: see Comments lines of A226492.

s=0;lst={s};Do[s+=n;AppendTo[lst,s],{n,3,6!,27}];lst (* Vladimir Joseph Stephan Orlovsky, Apr 02 2009 *)
Table[3*n*(9*n-7)/2, {n,0,25}] (* or *) LinearRecurrence[{3,-3,1},{0,3,33},25] (* G. C. Greubel, Aug 28 2016 *)

a(n)=3*n*(9*n-7)/2 \\ Charles R Greathouse IV, Oct 07 2015

a(n) = (27*n^2 - 21*n)/2 = A051682(n)*3.
a(n) = 27*n + a(n-1) - 24, with n>0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
G.f.: 3*x*(1 + 8*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
From G. C. Greubel, Aug 28 2016: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
E.g.f.: (3/2)*x*(2 + 9*x)*exp(x). (End)

cp's OEIS Frontend

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

A038764 a(n) = (9*n^2 + 3*n + 2)/2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Sage

Formula

Extensions

A062728 Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

Extensions

A218470 Partial sums of floor(n/9).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A022266 a(n) = n*(9*n - 1)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A226492 a(n) = n*(11*n-5)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

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

A038764 a(n) = (9n^2 + 3n + 2)/2.

A062728 Second 11-gonal (or hendecagonal) numbers: a(n) = n(9n+7)/2.

A022266 a(n) = n(9n - 1)/2.

A226492 a(n) = n(11n-5)/2.

A051868 16-gonal (or hexadecagonal) numbers: a(n) = n(7n-6).

A153783 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3n(9*n-7)/2.