A049452 -id:A049452 - cp's OEIS frontend

A049450 Pentagonal numbers multiplied by 2: a(n) = n(3n-1).

0, 2, 10, 24, 44, 70, 102, 140, 184, 234, 290, 352, 420, 494, 574, 660, 752, 850, 954, 1064, 1180, 1302, 1430, 1564, 1704, 1850, 2002, 2160, 2324, 2494, 2670, 2852, 3040, 3234, 3434, 3640, 3852, 4070, 4294, 4524, 4760, 5002, 5250, 5504, 5764

Offset: 0

Joe Keane (jgk(AT)jgk.org)

From Floor van Lamoen, Jul 21 2001: (Start)
Write 1,2,3,4,... in a hexagonal spiral around 0, then a(n) is the sequence found by reading the line from 0 in the direction 0,2,.... The spiral begins:
.
                   56--55--54--53--52
                   /                 \
                 57  33--32--31--30  51
                 /   /             \   \
               58  34  16--15--14  29  50
               /   /   /         \   \   \
             59  35  17   5---4  13  28  49
             /   /   /   /     \   \   \   \
           60  36  18   6   0   3  12  27  48
           /   /   /   /   / . /   /   /   /
         61  37  19   7   1---2  11  26  47
           \   \   \   \       . /   /   /
           62  38  20   8---9--10  25  46
             \   \   \           . /   /
             63  39  21--22--23--24  45
               \   \               . /
               64  40--41--42--43--44
                 \                   .
                 65--66--67--68--69--70
(End)
Starting with offset 1 = binomial transform of [2, 8, 6, 0, 0, 0, ...]. - Gary W. Adamson, Jan 09 2009
Number of possible pawn moves on an (n+1) X (n+1) chessboard (n=>3). - Johannes W. Meijer, Feb 04 2010
a(n) = A069905(6n-1): Number of partitions of 6*n-1 into 3 parts. - Adi Dani, Jun 04 2011
Even octagonal numbers divided by 4. - Omar E. Pol, Aug 19 2011
Partial sums give A011379. - Omar E. Pol, Jan 12 2013
First differences are A016933; second differences equal 6. - Bob Selcoe, Apr 02 2015
For n >= 1, the continued fraction expansion of sqrt(27*a(n)) is [9n-2; {2, 2n-1, 6, 2n-1, 2, 18n-4}]. - Magus K. Chu, Oct 13 2022

			On a 4 X 4 chessboard pawns at the second row have (3+4+4+3) moves and pawns at the third row have (2+3+3+2) moves so a(3) = 24. - _Johannes W. Meijer_, Feb 04 2010
From _Adi Dani_, Jun 04 2011: (Start)
a(1)=2: the partitions of 6*1-1=5 into 3 parts are [1,1,3] and[1,2,2].
a(2)=10: the partitions of 6*2-1=11 into 3 parts are [1,1,9], [1,2,8], [1,3,7], [1,4,6], [1,5,5], [2,2,7], [2,3,6], [2,4,5], [3,3,5], and [3,4,4].
(End)
.
.                                                         o
.                                                       o o o
.                                      o              o o o o o
.                                    o o o          o o o o o o o
.                       o          o o o o o      o o o o o o o o o
.                     o o o      o o o o o o o    o o o o o o o o o
.            o      o o o o o    o o o o o o o    o o o o o o o o o
.          o o o    o o o o o    o o o o o o o    o o o o o o o o o
.    o     o o o    o o o o o    o o o o o o o    o o o o o o o o o
.    o     o o o    o o o o o    o o o o o o o    o o o o o o o o o
.    2      10         24             44                 70
- _Philippe Deléham_, Mar 30 2013

Ivan Panchenko, Table of n, a(n) for n = 0..1000
Richard P. Brent, Generalising Tuenter's binomial sums, arXiv:1407.3533 [math.CO], 2014. (page 16)
Leo Tavares, Illustration: X Hexagons
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000567.
Bisection of A001859. Cf. A045944, A000326, A033579, A027599, A049451.
Cf. A033586 (King), A035005 (Queen), A035006 (Rook), A035008 (Knight) and A002492 (Bishop).
Cf. numbers of the form n*(n*k-k+4)/2 listed in A226488. [Bruno Berselli, Jun 10 2013]
Cf. sequences listed in A254963.
Cf. A003215, A016813, A000290, A000217.

List([0..50], n-> n*(3*n-1)); # G. C. Greubel, Aug 31 2019

[n*(3*n-1) : n in [0..50]]; // Wesley Ivan Hurt, Sep 24 2017

seq(n*(3*n-1),n=0..44); # Zerinvary Lajos, Jun 12 2007

Table[n(3n-1),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,2,10},50] (* Harvey P. Dale, Jun 21 2014 *)
2*PolygonalNumber[5,Range[0,50]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jun 01 2018 *)

a(n)=n*(3*n-1) \\ Charles R Greathouse IV, Nov 20 2012

[n*(3*n-1) for n in (0..50)] # G. C. Greubel, Aug 31 2019

O.g.f.: A(x) = 2*x*(1+2*x)/(1-x)^3.
a(n) = A049452(n) - A033428(n). - Zerinvary Lajos, Jun 12 2007
a(n) = 2*A000326(n), twice pentagonal numbers. - Omar E. Pol, May 14 2008
a(n) = A022264(n) - A000217(n). - Reinhard Zumkeller, Oct 09 2008
a(n) = a(n-1) + 6*n - 4 (with a(0)=0). - Vincenzo Librandi, Aug 06 2010
a(n) = A014642(n)/4 = A033579(n)/2. - Omar E. Pol, Aug 19 2011
a(n) = A000290(n) + A000384(n) = A000217(n) + A000566(n). - Omar E. Pol, Jan 11 2013
a(n+1) = A014107(n+2) + A000290(n). - Philippe Deléham, Mar 30 2013
E.g.f.: x*(2 + 3*x)*exp(x). - Vincenzo Librandi, Apr 28 2016
a(n) = (2/3)*A000217(3*n-1). - Bruno Berselli, Feb 13 2017
a(n) = A002061(n) + A056220(n). - Bruce J. Nicholson, Sep 21 2017
From Amiram Eldar, Feb 20 2022: (Start)
Sum_{n>=1} 1/a(n) = 3*log(3)/2 - Pi/(2*sqrt(3)).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/sqrt(3) - 2*log(2). (End)
From Leo Tavares, Feb 23 2022: (Start)
a(n) = A003215(n) - A016813(n).
a(n) = 2*A000290(n) + 2*A000217(n-1). (End)

A033429 a(n) = 5*n^2.

Original entry on oeis.org

0, 5, 20, 45, 80, 125, 180, 245, 320, 405, 500, 605, 720, 845, 980, 1125, 1280, 1445, 1620, 1805, 2000, 2205, 2420, 2645, 2880, 3125, 3380, 3645, 3920, 4205, 4500, 4805, 5120, 5445, 5780, 6125, 6480, 6845, 7220, 7605, 8000, 8405, 8820, 9245, 9680, 10125, 10580, 11045, 11520, 12005, 12500

Offset: 0

Jeff Burch

Number of edges of the complete bipartite graph of order 6n, K_n,5n. - Roberto E. Martinez II, Jan 07 2002
Number of edges of the complete tripartite graph of order 4n, K_n,n,2n. - Roberto E. Martinez II, Jan 07 2002
a(n+1)-a(n) : 5, 15, 25, 35, 45, ... (see A017329). - Philippe Deléham, Dec 08 2011
From Larry J Zimmermann, Feb 21 2013: (Start)
The sum of the areas of 2 squares that equals the area of a rectangle with whole number sides using the formula x^2 + y^2 = (x+y+sqrt(2*x*y))(x+y-sqrt(2*x*y)), where the substitution y=2*x obtains the whole number sides of the rectangle. So x^2+(2*x)^2=5x(x).
  x     squares sum      rectangle (l,w)   area
  1     1,4     5                   5,1    5
  2     4,16    20                  10,2   20  (End)

G. C. Greubel, Table of n, a(n) for n = 0..5000
Lancelot Hogben, Choice and Chance by Cardpack and Chessboard, Vol. 1, Max Parrish and Co, London, 1950, p. 36.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Central column of A055096.
Cf. A000290.
Cf. numbers of the form  n*(d*n+10-d)/2:  A008587, A056000, A028347, A140090, A014106, A028895, A045944, A186029, A007742, A022267, A022268, A049452, A186030, A135703, A152734, A139273.
Cf. A185019.
Cf. A001105, A033428.
Similar sequences are listed in A316466.

5*Range[50]^2 (* Alonso del Arte, May 23 2012 *)

PARI
```
a(n)=5*n^2
```

a(n) = 5*A000290(n). - Omar E. Pol, Dec 11 2008
From Bruno Berselli, Feb 11 2011: (Start)
G.f.: 5*x*(1+x)/(1-x)^3.
a(n) = 4*A000217(n) + A000567(n). (End)
a(n) = a(n-1)+5*(2*n-1) (with a(0)=0). - Vincenzo Librandi, Nov 17 2010
a(n) = A131242(10*n+4). - Philippe Deléham, Mar 27 2013
a(n) = a(n-1) + 10*n - 5, with a(0)=0. - Jean-Bernard François, Oct 04 2013
a(n) = A001105(n) + A033428(n). - Altug Alkan, Sep 28 2015
E.g.f.: 5*x*(x+1)*exp(x). - G. C. Greubel, Jul 17 2017
a(n) = Sum_{i = 2..6} P(i,n), where P(i,m) = m*((i-2)*m-(i-4))/2. - Bruno Berselli, Jul 04 2018
From Amiram Eldar, Feb 03 2021: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/30.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/60.
Product_{n>=1} (1 + 1/a(n)) = sqrt(5)*sinh(Pi/sqrt(5))/Pi.
Product_{n>=1} (1 - 1/a(n)) = sqrt(5)*sin(Pi/sqrt(5))/Pi. (End)

Better description from N. J. A. Sloane, May 15 1998

A140090 a(n) = n(3n + 7)/2.

Original entry on oeis.org

0, 5, 13, 24, 38, 55, 75, 98, 124, 153, 185, 220, 258, 299, 343, 390, 440, 493, 549, 608, 670, 735, 803, 874, 948, 1025, 1105, 1188, 1274, 1363, 1455, 1550, 1648, 1749, 1853, 1960, 2070, 2183, 2299, 2418, 2540, 2665, 2793, 2924

Offset: 0

Omar E. Pol, May 22 2008

This sequence is mentioned in the Guo-Niu Han's paper, chapter 6: Dictionary of the standard puzzle sequences, p. 19 (see link). - Omar E. Pol, Oct 28 2011

Number of cards needed to build an n-tier house of cards with a flat, one-card-wide roof. - Tyler Busby, Dec 28 2022

G. C. Greubel, Table of n, a(n) for n = 0..5000
Guo-Niu Han, Enumeration of Standard Puzzles, 2011. [Cached copy]
Guo-Niu Han, Enumeration of Standard Puzzles, arXiv:2006.14070 [math.CO], 2020.
Sela Fried, Counting r X s rectangles in nondecreasing and Smirnov words, arXiv:2406.18923 [math.CO], 2024. See p. 5.
Julie Zhang, Noah A. Rosenberg, and Julia A. Palacios, The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains, arXiv:2506.10856 [math.PR], 2025. See p. 33.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

The generalized pentagonal numbers b*n+3*n*(n-1)/2, for b = 1 through 12, form sequences A000326, A005449, A045943, A115067, this sequence, A140091, A059845, A140672, A140673, A140674, A140675, A151542.

Cf. numbers of the form n*(d*n + 10 - d)/2: A008587, A056000, A028347, A014106, A028895, A045944, A186029, A007742, A022267, A033429, A022268, A049452, A186030, A135703, A152734, A139273.

LinearRecurrence[{3,-3,1},{0,5,13},50] (* Harvey P. Dale, Jan 17 2022 *)

a(n)=n*(3*n+7)/2 \\ Charles R Greathouse IV, Sep 24 2015

G.f.: x*(5 - 2*x)/(1 - x)^3. - Bruno Berselli, Feb 11 2011
a(n) = (3*n^2 + 7*n)/2.
a(n) = a(n-1) + 3*n + 2 (with a(0)=0). - Vincenzo Librandi, Nov 24 2010
E.g.f.: (1/2)*(3*x^2 + 10*x)*exp(x). - G. C. Greubel, Jul 17 2017
From Amiram Eldar, Feb 22 2022: (Start)
Sum_{n>=1} 1/a(n) = 117/98 - Pi/(7*sqrt(3)) - 3*log(3)/7.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*Pi/(7*sqrt(3)) + 4*log(2)/7 - 75/98. (End)

A049453 Second pentagonal numbers with even index: a(n) = n(6n+1).

Original entry on oeis.org

0, 7, 26, 57, 100, 155, 222, 301, 392, 495, 610, 737, 876, 1027, 1190, 1365, 1552, 1751, 1962, 2185, 2420, 2667, 2926, 3197, 3480, 3775, 4082, 4401, 4732, 5075, 5430, 5797, 6176, 6567, 6970, 7385, 7812, 8251, 8702, 9165, 9640, 10127, 10626, 11137, 11660, 12195

Offset: 0

Joe Keane (jgk(AT)jgk.org)

Number of edges in the join of the complete tripartite graph of order 3n and the cycle graph of order n, K_n,n,n * C_n. - Roberto E. Martinez II, Jan 07 2002
Sequence found by reading the line (one of the diagonal axes) from 0, in the direction 0, 7, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. - Omar E. Pol, Sep 08 2011
First bisection of A036498. - Bruno Berselli, Nov 25 2012

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. A001318, A005449, A033568, A033570, A036498, A049452, A185019, A194454.

Cf. A254963 (comment).

seq(binomial(6*n+1,2)/3, n=0..42); # Zerinvary Lajos, Jan 21 2007

s=0;lst={s};Do[s+=n++ +7;AppendTo[lst, s], {n, 0, 7!, 12}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 16 2008 *)
Table[n*(6*n + 1), {n,0,50}] (* G. C. Greubel, Jun 07 2017 *)

x='x+O('x^50); concat([0], Vec(x*(7+5*x)/(1-x)^3)) \\ G. C. Greubel, Jun 07 2017

G.f.: x*(7+5*x)/(1-x)^3.
a(n) = 12*n + a(n-1) - 5 with n > 0, a(0)=0. - Vincenzo Librandi, Aug 06 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - G. C. Greubel, Jun 07 2017
From Amiram Eldar, Feb 18 2022: (Start)
Sum_{n>=1} 1/a(n) = 6 - sqrt(3)*Pi/2 - 2*log(2) - 3*log(3)/2.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi + log(2) + sqrt(3)*log(2 + sqrt(3)) - 6. (End)
E.g.f.: exp(x)*x*(7 + 6*x). - Elmo R. Oliveira, Dec 12 2024

A033570 Pentagonal numbers with odd index: a(n) = (2n+1)(3*n+1).

Original entry on oeis.org

1, 12, 35, 70, 117, 176, 247, 330, 425, 532, 651, 782, 925, 1080, 1247, 1426, 1617, 1820, 2035, 2262, 2501, 2752, 3015, 3290, 3577, 3876, 4187, 4510, 4845, 5192, 5551, 5922, 6305, 6700, 7107, 7526, 7957, 8400, 8855, 9322, 9801, 10292, 10795, 11310, 11837

Offset: 0

N. J. A. Sloane

If Y is a 3-subset of an 2*n-set X then, for n >= 4, a(n-2) is the number of 4-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 16 2007
Sequence found by reading the line (one of the diagonal axes) from 1, in the direction 1, 12, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. - Omar E. Pol, Sep 08 2011
If two independent real random variables, x and y, are distributed according to the same exponential distribution: pdf(x) = lambda * exp(-lambda * x), lambda > 0, then the probability that 2 <= x/(n*y) < 3 is given by n/a(n) (for n>1). - Andres Cicuttin, Dec 11 2016
a(n) is the sum of 2*n+1 consecutive integers starting from 2*n+1. - Bruno Berselli, Jan 16 2018

Michael De Vlieger, Table of n, a(n) for n = 0..10000
John Elias, Illustration: Natural number stars.
Leo Tavares, Illustration: Square Block Triangles
Eric Weisstein's World of Mathematics, Pentagonal Number.
Wikipedia, Pentagonal number.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000326, A001318, A033568, A049452, A049453, A191967.

Cf. A016754, A014105.

List([0..50], n-> (2*n+1)*(3*n+1)); # G. C. Greubel, Oct 12 2019

[(2*n+1)*(3*n+1) : n in [0..50]]; // Wesley Ivan Hurt, Dec 11 2016

A033570:=n->(2*n+1)*(3*n+1); seq(A033570(n), n=0..40); # Wesley Ivan Hurt, Mar 18 2014

LinearRecurrence[{3,-3,1},{1,12,35},50]
Table[(2 n + 1) (3 n + 1), {n, 0, 50}] (* or *)
CoefficientList[Series[(1 + 9 x + 2 x^2)/(1 - x)^3, {x, 0, 50}], x] (* Michael De Vlieger, Dec 12 2016 *)
PolygonalNumber[5,Range[1,101,2]] (* Harvey P. Dale, Aug 02 2021 *)

a(n)=(2*n+1)*(3*n+1) \\ Charles R Greathouse IV, Jun 11 2015

[(2*n+1)*(3*n+1) for n in range(50)] # G. C. Greubel, Oct 12 2019

G.f.: (1 + 9*x + 2*x^2)/(1-x)^3.
a(n) = a(n-1) + 12*n-1 for n > 0, a(0)=1. - Vincenzo Librandi, Nov 17 2010
a(n) = A000326(2*n+1) = A191967(2*n+1). - Reinhard Zumkeller, Jul 07 2012
a(n) = Sum_{i=1..2*(n+1)-1} 4*(n+1) - 2 - i. - Wesley Ivan Hurt, Mar 18 2014
E.g.f.: (1 + 11*x + 6*x^2)*exp(x). - G. C. Greubel, Oct 12 2019
From Amiram Eldar, Feb 20 2022: (Start)
Sum_{n>=0} 1/a(n) = Pi/(2*sqrt(3)) - 2*log(2) + 3*log(3)/2.
Sum_{n>=0} (-1)^n/a(n) = (1/sqrt(3) - 1/2)*Pi + log(2). (End)
a(n) = A016754(n) + A014105(n). - Leo Tavares, May 24 2022

More terms from Ray Chandler, Dec 08 2011

A022267 a(n) = n(9n + 1)/2.

Original entry on oeis.org

0, 5, 19, 42, 74, 115, 165, 224, 292, 369, 455, 550, 654, 767, 889, 1020, 1160, 1309, 1467, 1634, 1810, 1995, 2189, 2392, 2604, 2825, 3055, 3294, 3542, 3799, 4065, 4340, 4624, 4917, 5219, 5530, 5850, 6179

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, 5, ... . 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) is the sum of n consecutive integers starting from 4*n+1: (5), (9+10), (13+14+15), ... - Klaus Purath, Jul 07 2020
a(n) with n>0 are the numbers with the periodic length 3 in the Bulgarian and Mancala solitaire. - Paul Weisenhorn, Jan 29 2022

Lei Zhou, Table of n, a(n) for n = 0..10000
Milan Janjic, Two Enumerative Functions
Leo Tavares, Illustration: X Triangles
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A051682, A110449, A235332.
Cf. numbers of the form n*(d*n+10-d)/2: A008587, A056000, A028347, A140090, A014106, A028895, A045944, A186029, A007742, A033429, A022268, A049452, A186030, A135703, A152734, A139273.
Cf. similar sequences listed in A254963.
Cf. similar sequences listed in A022289.
Cf. A060544, A016813.

seq(binomial(9*n+1,2)/9, n=0..37); # Zerinvary Lajos, Jan 21 2007

Table[ n (9 n + 1)/2, {n, 0, 40}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 5, 19}, 40] (* Harvey P. Dale, Jul 01 2013 *)

vector(100,n,(n-1)*(9*n-8)/2) \\ Derek Orr, Feb 06 2015

a(n) = A110449(n, 4) for n>3.
From Bruno Berselli, Feb 11 2011: (Start)
G.f.: x*(5 + 4*x)/(1 - x)^3.
a(n) = 4*A000217(n) + A000566(n). (End)
a(n) = 9*n + a(n-1) - 4 with n>0, a(0)=0. - Vincenzo Librandi, Aug 04 2010
a(n) = A218470(9*n+4). - Philippe Deléham, Mar 27 2013
a(n) = A000217(5*n) - A000217(4*n). - Bruno Berselli, Oct 13 2016
E.g.f.: (1/2)*(9*x^2 + 10*x)*exp(x). - G. C. Greubel, Jul 17 2017
a(n) = A060544(n+1) - A016813(n). - Leo Tavares, Mar 20 2022

A185019 a(n) = n(14n-3).

Original entry on oeis.org

0, 11, 50, 117, 212, 335, 486, 665, 872, 1107, 1370, 1661, 1980, 2327, 2702, 3105, 3536, 3995, 4482, 4997, 5540, 6111, 6710, 7337, 7992, 8675, 9386, 10125, 10892, 11687, 12510, 13361, 14240, 15147, 16082, 17045, 18036, 19055, 20102, 21177, 22280, 23411, 24570

Offset: 0

Bruno Berselli, Oct 14 2011 - based on remarks and sequences by Omar E. Pol

Bruno Berselli, Table of n, a(n) for n = 0..1000
Bruno Berselli, Illustration of initial terms: An origin of A185019.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A013656, A033429, A049452, A049453, A147296, A195025.
Cf. A000384, A195023, A195024, A135703.
Cf. A195020 (vertices of the numerical spiral in link).

Magma
```
[n*(14*n-3): n in [0..42]];
```

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

CoefficientList[Series[x (11 + 17 x)/(1 - x)^3, {x, 0, 45}], x] (* Vincenzo Librandi, Aug 18 2013 *)

PARI
```
for(n=0, 42, print1(n*(14*n-3)", "));
```

G.f.: x*(11+17*x)/(1-x)^3.
a(n) = A195025(-n).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3. - Wesley Ivan Hurt, Dec 18 2020
From Elmo R. Oliveira, Dec 30 2024: (Start)
E.g.f.: exp(x)*x*(11 + 14*x).
a(n) = n + A195023(n). (End)

A139273 a(n) = n(8n - 3).

Original entry on oeis.org

0, 5, 26, 63, 116, 185, 270, 371, 488, 621, 770, 935, 1116, 1313, 1526, 1755, 2000, 2261, 2538, 2831, 3140, 3465, 3806, 4163, 4536, 4925, 5330, 5751, 6188, 6641, 7110, 7595, 8096, 8613, 9146, 9695, 10260, 10841, 11438, 12051, 12680

Offset: 0

Omar E. Pol, Apr 26 2008

Sequence found by reading the line from 0, in the direction 0, 5, ..., in the square spiral whose vertices are the triangular numbers A000217. Opposite numbers to the members of A139277 in the same spiral.
Also, sequence of numbers of the form d*A000217(n-1) + 5*n with generating functions x*(5+(d-5)*x)/(1-x)^3; the inverse binomial transform is 0,5,d,0,0,.. (0 continued). See Crossrefs. - Bruno Berselli, Feb 11 2011
Even decagonal numbers divided by 2. - Omar E. Pol, Aug 19 2011

G. C. Greubel, Table of n, a(n) for n = 0..5000
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A014634, A014635, A033585, A033586, A033587, A035008, A051870, A069129, A085250, A072279, A139272, A139274, A139275, A139276, A139278, A139279, A139280, A139281, A139282.

Cf. numbers of the form n*(d*n+10-d)/2: A008587, A056000, A028347, A140090, A014106, A028895, A045944, A186029, A007742, A022267, A033429, A022268, A049452, A186030, A135703, A152734.

[ n*(8*n-3) : n in [0..40] ];  // Bruno Berselli, Feb 11 2011

Table[n (8 n - 3), {n, 0, 40}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 5, 26}, 40] (* Harvey P. Dale, Feb 02 2012 *)

a(n)=n*(8*n-3) \\ Charles R Greathouse IV, Sep 24 2015

a(n) = 8*n^2 - 3*n.
Sequences of the form a(n) = 8*n^2 + c*n have generating functions x{c+8+(8-c)x} / (1-x)^3 and recurrence a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). The inverse binomial transform is 0, c+8, 16, 0, 0, ... (0 continued). This applies to A139271-A139278, positive or negative c. - R. J. Mathar, May 12 2008
a(n) = 16*n + a(n-1) - 11 for n>0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
From Bruno Berselli, Feb 11 2011: (Start)
G.f.: x*(5 + 11*x)/(1 - x)^3.
a(n) = 4*A000217(n) + A051866(n). (End)
a(n) = A028994(n)/2. - Omar E. Pol, Aug 19 2011
a(0)=0, a(1)=5, a(2)=26; for n>2, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Feb 02 2012
E.g.f.: (8*x^2 + 5*x)*exp(x). - G. C. Greubel, Jul 18 2017
Sum_{n>=1} 1/a(n) = 4*log(2)/3 - (sqrt(2)-1)*Pi/6 - sqrt(2)*arccoth(sqrt(2))/3. - Amiram Eldar, Jul 03 2020

A033568 Second pentagonal numbers with odd index: a(n) = (2n-1)(3*n-1).

Original entry on oeis.org

1, 2, 15, 40, 77, 126, 187, 260, 345, 442, 551, 672, 805, 950, 1107, 1276, 1457, 1650, 1855, 2072, 2301, 2542, 2795, 3060, 3337, 3626, 3927, 4240, 4565, 4902, 5251, 5612, 5985, 6370, 6767, 7176, 7597, 8030, 8475, 8932, 9401, 9882, 10375, 10880, 11397, 11926

Offset: 0

N. J. A. Sloane

Sequence found by reading the segment (1, 2) together with the line (one of the diagonal axes) from 2, in the direction 2, 15, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. - Omar E. Pol, Sep 08 2011

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. A001318, A005449, A033570, A049452, A049453, A051866.

List([0..50], n-> (2*n-1)*(3*n-1)); # G. C. Greubel, Oct 12 2019

[(2*n-1)*(3*n-1): n in [0..50]]; // G. C. Greubel, Oct 12 2019

seq((2*n-1)*(3*n-1), n=0..50); # G. C. Greubel, Oct 12 2019

Table[(2*n-1)*(3*n-1),{n,0,50}] (* Vladimir Joseph Stephan Orlovsky, Apr 28 2010 *)
LinearRecurrence[{3,-3,1},{1,2,15},50] (* Ray Chandler, Dec 08 2011 *)

a(n)=(2*n-1)*(3*n-1) \\ Charles R Greathouse IV, Sep 24 2015

[(2*n-1)*(3*n-1) for n in range(50)] # G. C. Greubel, Oct 12 2019

G.f.: (1-x+12*x^2)/(1-x)^3.
a(n) = a(n-1) + 12*n - 11 (with a(0)=1). - Vincenzo Librandi, Nov 17 2010
a(n) = 6*n^2 - 5*n + 1 = A051866(n) + 1. - Omar E. Pol, Jul 18 2012
E.g.f.: (1 + x + 6*x^2)*exp(x). - G. C. Greubel, Oct 12 2019
From Amiram Eldar, Feb 18 2022: (Start)
Sum_{n>=0} 1/a(n) = 1 + Pi/(2*sqrt(3)) + 2*log(2) - 3*log(3)/2.
Sum_{n>=0} (-1)^n/a(n) = 1 + (1/sqrt(3) - 1/2)*Pi - log(2). (End)

More terms from Ray Chandler, Dec 08 2011

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

cp's OEIS Frontend

A049450 Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A033429 a(n) = 5*n^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A140090 a(n) = n*(3*n + 7)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A049453 Second pentagonal numbers with even index: a(n) = n*(6*n+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A033570 Pentagonal numbers with odd index: a(n) = (2*n+1)*(3*n+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A022267 a(n) = n*(9*n + 1)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A049450 Pentagonal numbers multiplied by 2: a(n) = n(3n-1).

A140090 a(n) = n(3n + 7)/2.

A049453 Second pentagonal numbers with even index: a(n) = n(6n+1).

A033570 Pentagonal numbers with odd index: a(n) = (2n+1)(3*n+1).

A022267 a(n) = n(9n + 1)/2.

A185019 a(n) = n(14n-3).

A139273 a(n) = n(8n - 3).

A033568 Second pentagonal numbers with odd index: a(n) = (2n-1)(3*n-1).

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