A045944 -id:A045944 - cp's OEIS frontend

A033954 Second 10-gonal (or decagonal) numbers: n(4n+3).

0, 7, 22, 45, 76, 115, 162, 217, 280, 351, 430, 517, 612, 715, 826, 945, 1072, 1207, 1350, 1501, 1660, 1827, 2002, 2185, 2376, 2575, 2782, 2997, 3220, 3451, 3690, 3937, 4192, 4455, 4726, 5005, 5292, 5587, 5890, 6201, 6520, 6847, 7182, 7525, 7876, 8235

Offset: 0

N. J. A. Sloane

Same as A033951 except start at 0. See example section.

Bisection of A074377. Also sequence found by reading the line from 0, in the direction 0, 22, ... and the line from 7, in the direction 7, 45, ..., in the square spiral whose vertices are the generalized 10-gonal numbers A074377. - Omar E. Pol, Jul 24 2012

			  36--37--38--39--40--41--42
   |                       |
  35  16--17--18--19--20  43
   |   |               |   |
  34  15   4---5---6  21  44
   |   |   |       |   |   |
  33  14   3   0===7==22==45==76=>
   |   |   |   |   |   |
  32  13   2---1   8  23
   |   |           |   |
  31  12--11--10---9  24
   |                   |
  30--29--28--27--26--25

S. M. Ellerstein, The square spiral, J. Recreational Mathematics 29 (#3, 1998) 188; 30 (#4, 1999-2000), 246-250.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.

Ivan Panchenko, Table of n, a(n) for n = 0..1000
Emilio Apricena, A version of the Ulam spiral.
Leo Tavares, Illustration: V numbers
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A002620, A033951.
Sequences from spirals: A001107, A002939, A007742, A033951, A033952, A033953, A033954, A033989, A033990, A033991, A002943, A033996, A033988.
Sequences on the four axes of the square spiral: Starting at 0: A001107, A033991, A007742, A033954; starting at 1: A054552, A054556, A054567, A033951.
Sequences on the four diagonals of the square spiral: Starting at 0: A002939 = 2*A000384, A016742 = 4*A000290, A002943 = 2*A014105, A033996 = 8*A000217; starting at 1: A054554, A053755, A054569, A016754.
Sequences obtained by reading alternate terms on the X and Y axes and the two main diagonals of the square spiral: Starting at 0: A035608, A156859, A002378 = 2*A000217, A137932 = 4*A002620; starting at 1: A317186, A267682, A002061, A080335.
Second n-gonal numbers: A005449, A014105, A147875, A045944, A179986, this sequence, A062728, A135705.
Cf. A060544.

List([0..50], n-> n*(4*n+3)) # G. C. Greubel, May 24 2019

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

Table[n(4n+3),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,7,22},50] (* Harvey P. Dale, May 06 2018 *)

PARI
```
a(n)=4*n^2+3*n
```

[n*(4*n+3) for n in (0..50)] # G. C. Greubel, May 24 2019

a(n) = A001107(-n) = A074377(2*n).
G.f.: x*(7+x)/(1-x)^3. - Michael Somos, Mar 03 2003
a(n) = a(n-1) + 8*n - 1 with a(0)=0. - Vincenzo Librandi, Jul 20 2010
For n>0, Sum_{j=0..n} (a(n) + j)^4 + (4*A000217(n))^3 = Sum_{j=n+1..2n} (a(n) + j)^4; see also A045944. - Charlie Marion, Dec 08 2007, edited by Michel Marcus, Mar 14 2014
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) with a(0) = 0, a(1) = 7, a(2) = 22. - Philippe Deléham, Mar 26 2013
a(n) = A118729(8n+6). - Philippe Deléham, Mar 26 2013
a(n) = A002943(n) + n = A007742(n) + 2n = A016742(n) + 3n = A033991(n) + 4n = A002939(n) + 5n = A001107(n) + 6n = A033996(n) - n. - Philippe Deléham, Mar 26 2013
Sum_{n>=1} 1/a(n) = 4/9 + Pi/6 - log(2) = 0.2748960394827980081... . - Vaclav Kotesovec, Apr 27 2016
E.g.f.: exp(x)*x*(7 + 4*x). - Stefano Spezia, Jun 08 2021
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/(3*sqrt(2)) + log(2)/3 - 4/9 - sqrt(2)*arcsinh(1)/3. - Amiram Eldar, Nov 28 2021
For n>0, (a(n)^2 + n)/(a(n) + n) = (4*n + 1)^2/4, a ratio of two squares. - Rick L. Shepherd, Feb 23 2022
a(n) = A060544(n+1) - A000217(n+1). - Leo Tavares, Mar 31 2022

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

Original entry on oeis.org

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)

A147875 Second heptagonal numbers: a(n) = n(5n+3)/2.

Original entry on oeis.org

0, 4, 13, 27, 46, 70, 99, 133, 172, 216, 265, 319, 378, 442, 511, 585, 664, 748, 837, 931, 1030, 1134, 1243, 1357, 1476, 1600, 1729, 1863, 2002, 2146, 2295, 2449, 2608, 2772, 2941, 3115, 3294, 3478, 3667, 3861, 4060, 4264, 4473, 4687, 4906, 5130, 5359, 5593

Offset: 0

Vladimir Joseph Stephan Orlovsky, Nov 16 2008

Zero followed by partial sums of A016897.
Apparently = every 2nd term of A111710 and A085787.
Bisection of A085787. Sequence found by reading the line from 0, in the direction 0, 13, ... and the line from 4, in the direction 4, 27, ..., in the square spiral whose vertices are the generalized heptagonal numbers A085787. - Omar E. Pol, Jul 18 2012
Numbers of the form m^2 + k*m*(m+1)/2: in this case is k=3. See also A254963. - Bruno Berselli, Feb 11 2015

			G.f. = 4*x + 13*x^2 + 27*x^3 + 46*x^4 + 70*x^5 + 99*x^6 + 133*x^7 + ... - _Michael Somos_, Jan 25 2019

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Leo Tavares, Illustration: Sliced Hexagons
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A016897, A111710, A000217, A085787, A224419 (positions of squares).
Second n-gonal numbers: A005449, A014105, A045944, A179986, A033954, A062728, A135705.
Cf. A000566.
Cf. A003215, A000096, A000290.

List([0..50], n-> n*(5*n+3)/2); # G. C. Greubel, Jul 04 2019

[n*(5*n+3)/2: n in [0..50]]; // G. C. Greubel, Jul 04 2019

Table[(n(5n+3))/2, {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 4, 13}, 50] (* Harvey P. Dale, May 15 2013 *)

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

[n*(5*n+3)/2 for n in (0..50)] # G. C. Greubel, Jul 04 2019

G.f.: x*(4+x)/(1-x)^3.
a(n) = Sum_{k=0..n-1} A016897(k).
a(n) - a(n-1) = 5*n -1. - Vincenzo Librandi, Nov 26 2010
G.f.: U(0) where U(k) = 1 + 2*(2*k+3)/(k + 2 - x*(k+2)^2*(k+3)/(x*(k+2)*(k+3) + (2*k+2)*(2*k+3)/U(k+1))); (continued fraction, 3-step). - Sergei N. Gladkovskii, Nov 14 2012
E.g.f.: U(0) where U(k) = 1 + 2*(2*k+3)/(k + 2 - 2*x*(k+2)^2*(k+3)/(2*x*(k+2)*(k+3) + (2*k+2)^2*(2*k+3)/U(k+1))); (continued fraction, 3rd kind, 3-step). - Sergei N. Gladkovskii, Nov 14 2012
a(n) = A130520(5n+3). - Philippe Deléham, Mar 26 2013
a(n) = A131242(10n+7)/2. - Philippe Deléham, Mar 27 2013
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(0)=0, a(1)=4, a(2)=13. - Harvey P. Dale, May 15 2013
Sum_{n>=1} 1/a(n) = 10/9 + sqrt(1 - 2/sqrt(5))*Pi/3 - 5*log(5)/6 + sqrt(5)*log((1 + sqrt(5))/2)/3 = 0.4688420784500060750083432... . - Vaclav Kotesovec, Apr 27 2016
a(n) = A000217(n) + A000217(2*n). - Bruno Berselli, Jul 01 2016
From Ilya Gutkovskiy, Jul 01 2016: (Start)
E.g.f.: x*(8 + 5*x)*exp(x)/2.
Dirichlet g.f.: (5*zeta(s-2) + 3*zeta(s-1))/2. (End)
a(n) = A000566(-n) for all n in Z. - Michael Somos, Jan 25 2019
From Leo Tavares, Feb 14 2022: (Start)
a(n) = A003215(n) - A000217(n+1). See Sliced Hexagons illustration in links.
a(n) = A000096(n) + 2*A000290(n). (End)

Edited by Klaus Brockhaus and R. J. Mathar, Nov 20 2008

New name from Bruno Berselli, Jan 13 2011

A001859 Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).

Original entry on oeis.org

0, 2, 5, 10, 16, 24, 33, 44, 56, 70, 85, 102, 120, 140, 161, 184, 208, 234, 261, 290, 320, 352, 385, 420, 456, 494, 533, 574, 616, 660, 705, 752, 800, 850, 901, 954, 1008, 1064, 1121, 1180, 1240, 1302, 1365, 1430, 1496, 1564, 1633, 1704, 1776, 1850, 1925

Offset: 0

N. J. A. Sloane

Number of series-reduced planted trees with n+7 nodes and 3 internal nodes.
The trees enumerated with 3 internal nodes are of two types. Those with all internal nodes at different heights are enumerated by the triangular numbers. Those with two internal nodes at the same height are enumerated by the quarter squares. - Michael Somos, May 19 2000
Number of pairs (x,y) with x in {0,...,n}, y even in {0,...,2n}, and x < y. - Clark Kimberling, Jul 02 2012

			For n=1 we find 2 planted trees with 8 nodes, 3 of which are internal (i) and 5 are endpoints (e):
.e...e...e...e....e...e....
...i.......i........i...e..
.......i..............i...e
.......e................i..
........................e..
G.f. = 2*x + 5*x^2 + 10*x^3 + 16*x^4 + 24*x^5 + 33*x^6 + 44*x^7 + 56*x^8 + ...

John Riordan, personal communication.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..1000
D. D. Frey and J. A. Sellers, Jacobsthal Numbers and Alternating Sign Matrices, J. Integer Seqs., Vol. 3 (2000), #00.2.3
S. V. Gervacio and H. Maehara, Partial order on a family of k-subsets of a linearly ordered set, Discr. Math., 306 (2006), 413-419.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
J. Riordan, Letter to N. J. A. Sloane, Oct. 1970
S. G. Wagner, An identity for the cycle indices of rooted tree automorphism groups, Elec. J. Combinat., 13 (2006), #R00.
Index entries for sequences related to rooted trees.
Index entries for sequences related to trees.
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Cf. A000217, A002378, A002620, A004526, A006578, A045944, A049450.
First differences of A045947.
Antidiagonal sums of array A003984.
Cf. A107661, A077043.
Cf. A185212 (odd terms).

a001859 n = a000217 n + a002620 (n + 1)  -- Reinhard Zumkeller, Dec 20 2012

A001859:=(-1-z^2-2*z^3+z^4)/(z+1)/(z-1)^3; # conjectured by Simon Plouffe in his 1992 dissertation; gives sequence with an additional leading 1
with (combinat):seq(count(Partition((3*n+2)), size=3), n=0..50); # Zerinvary Lajos, Mar 28 2008

With[{nn=60},Total/@Thread[{Accumulate[Range[0,nn]],Floor[Range[ nn+1]^2/4]}]] (* or *) LinearRecurrence[{2,0,-2,1},{0,2,5,10},60] (* Harvey P. Dale, Apr 01 2012 *)

PARI
```
{a(n) = n + (3*n^2 + 1) \ 4};
```

a(n) = A000217(n)+A002620(n+1).
a(n) = n + floor( (3n^2+1)/4 ).
G.f.: (2*x+x^2)/((1-x)^2*(1-x^2)).
a(n) = a(n-1) + a(n-2) - a(n-3) + 3 = A002378(n) - A002620(n) = A006578(n-1) + A004526(n+1) - Henry Bottomley, Mar 08 2000
a(n) = A006578(-1-n) for all n in Z. - Michael Somos, May 10 2006
From Mitch Harris, Aug 22 2006: (Start)
a(n) = (6n^2 + 8n + 1 - (-1)^n)/8;
a(n) = Sum_{k=0..n} max(k, n-k). (End)
Starting (2, 5, 10, 16, 24, ...), = binomial transform of [2, 3, 2, -1, 2, -4, 8, -16, 32, ...]. - Gary W. Adamson, Nov 30 2007
a(0)=0, a(1)=2, a(2)=5, a(3)=10, a(n) = 2*a(n-1) + 0*a(n-2) - 2*a(n-3) + a(n-4). - Harvey P. Dale, Apr 01 2012
a(n) = 3*n*(n+1)/2 - A006578(n). - Clark Kimberling, Jul 02 2012
a(2*n) = A045944(n), a(2*n - 1) = A049450(n) for all n in Z. - Michael Somos, Nov 03 2014
0 = -6 + a(n) - 2*a(n+2) + a(n+4) for all n in Z. - Michael Somos, Nov 03 2014
0 = a(n)*(+a(n+1) - a(n+2)) + a(n+1)*(-3 - a(n+1) + a(n+2)) for all n in Z. - Michael Somos, Nov 03 2014
a(n) = Sum_{k=1..n} floor((n+k+2)/2). - Wesley Ivan Hurt, Mar 31 2017
Sum_{n>=1} 1/a(n) = 3/4 - Pi/(4*sqrt(3)) + 3*log(3)/4. - Amiram Eldar, May 28 2022
E.g.f.: (x*(7 + 3*x)*cosh(x) + (1 + 7*x + 3*x^2)*sinh(x))/4. - Stefano Spezia, Aug 22 2023

Entry improved by Michael Somos

A303428 Number of ways to write n as x(3x-2) + y(3y-2) + 3^u + 3^v, where x,y,u,v are integers with x <= y and 0 <= u <= v.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 2, 2, 1, 3, 3, 5, 2, 3, 3, 2, 2, 5, 4, 5, 2, 3, 5, 2, 3, 5, 4, 7, 2, 4, 5, 3, 4, 6, 4, 7, 3, 6, 6, 4, 4, 5, 5, 9, 5, 6, 6, 2, 5, 5, 7, 8, 4, 5, 4, 4, 4, 6, 6, 8, 3, 6, 6, 3, 4, 6, 7, 8, 5, 8, 6, 5, 4, 6, 7, 8, 6, 6, 6, 2

Offset: 1

Zhi-Wei Sun, Apr 23 2018

nonn

Conjecture: a(n) > 0 for all n > 1. Moreover, any integer n > 1 can be written as x*(3*x+2) + y*(3*y+2) + 3^z + 3^w, where x is an integer and y,z,w are nonnegative integers.
a(n) > 0 for all n = 2..3*10^8. Those x*(3*x-2) with x integral are called generalized octagonal numbers (A001082). 76683391 is the least integer n > 1 not representable as the sum of two generalized octagonal numbers and two powers of 2.
See also A303389, A303401 and A303432 for similar conjectures.

			a(2) = 1 with 2 = 0*(3*0-2) + 0*(3*0-2) + 3^0 + 3^0.
a(3) = 1 with 3 = 0*(3*0-2) + 1*(3*1-2) + 3^0 + 3^0.
a(4) = 2 with 4 = 1*(3*1-2) + 1*(3*1-2) + 3^0 + 3^0 = 0*(3*0-2) + 0*(3*0-2) + 3^0 + 3^1.
a(5) = 1 with 5 = 0*(3*0-2) + 1*(3*1-2) + 3^0 + 3^1.
a(9) = 1 with 9 = (-1)*(3*(-1)-2) + 0*(3*0-2) + 3^0 + 3^1.
a(4360) = 4 with 4360 = (-35)*(3*(-35)-2) + (-13)*(3*(-13)-2) + 3^0 + 3^4 = (-37)*(3*(-37)-2) + (-7)*(3*(-7)-2) + 3^2 + 3^2 = (-27)*(3*(-27)-2) + (-23)*(3*(-23)-2) + 3^5 + 3^5 = (-25)*(3*(-25)-2) + (-1)*(3*(-1)-2) + 3^5 + 3^7.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, A result similar to Lagrange's theorem, J. Number Theory 162(2016), 190-211.
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, New conjectures on representations of integers (I), Nanjing Univ. J. Math. Biquarterly 34(2017), no. 2, 97-120.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017-2018.

Cf. A000244, A000567, A001082, A045944, A280472, A303233, A303338, A303363, A303389, A303393, A303399, A303401, A303432.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
f[n_]:=f[n]=FactorInteger[n];
g[n_]:=g[n]=Sum[Boole[Mod[Part[Part[f[n],i],1],4]==3&&Mod[Part[Part[f[n],i],2],2]==1],{i,1,Length[f[n]]}]==0;
QQ[n_]:=QQ[n]=(n==0)||(n>0&&g[n]);
tab={};Do[r=0;Do[If[QQ[3(n-3^j-3^k)+2],Do[If[SQ[3(n-3^j-3^k-x(3x-2))+1],r=r+1],{x,-Floor[(Sqrt[3(n-3^j-3^k)/2+1]-1)/3],(Sqrt[3(n-3^j-3^k)/2+1]+1)/3}]],
{j,0,Log[3,n/2]},{k,j,Log[3,n-3^j]}];tab=Append[tab,r],{n,1,80}];Print[tab]

A212162 Triangle T(n,k), n>=1, 0<=k<=n^2, read by rows: row n gives the coefficients of the chromatic polynomial of the rhombic hexagonal square grid graph RH_(n,n), highest powers first.

Original entry on oeis.org

1, 0, 1, -5, 8, -4, 0, 1, -16, 112, -448, 1120, -1791, 1786, -1012, 248, 0, 1, -33, 510, -4898, 32703, -160859, 602408, -1749715, 3975561, -7068408, 9755858, -10265148, 7968348, -4304712, 1445104, -226720, 0, 1, -56, 1508, -25992, 321994, -3051871, 23000726, -141421592, 722137763, -3101089711

Offset: 1

Alois P. Heinz, May 02 2012

T differs from A212194 first at (n,k) = (5,10): T(5,10) = -3101089711, A212194(5,10) = -3101089710.

The rhombic hexagonal square grid graph RH_(n,n) has n^2 = A000290(n) vertices and (n-1)*(3*n-1) = A045944(n-1) edges. The chromatic polynomial of RH_(n,n) has n^2+1 = A002522(n) coefficients.

			3 example graphs:                        o--o--o
.                                        | /| /|
.                                        |/ |/ |
.                            o--o        o--o--o
.                            | /|        | /| /|
.                            |/ |        |/ |/ |
.               o            o--o        o--o--o
Graph:       RH_(1,1)      RH_(2,2)      RH_(3,3)
Vertices:       1             4             9
Edges:          0             5            16
The rhombic hexagonal square grid graph RH_(2,2) has chromatic polynomial q*(q-1)*(q-2)^2 = q^4 -5*q^3 +8*q^2 -4*q => row 2 = [1, -5, 8, -4, 0].
Triangle T(n,k) begins:
1,    0;
1,   -5,     8,      -4,        0;
1,  -16,   112,    -448,     1120,      -1791, ...
1,  -33,   510,   -4898,    32703,    -160859, ...
1,  -56,  1508,  -25992,   321994,   -3051871, ... , -3101089711, ...
1,  -85,  3520,  -94620,  1855860,  -28306676, ...
1, -120,  7068, -272344,  7720110, -171656543, ...
1, -161, 12782, -667058, 25738055, -783003395, ...

Alois P. Heinz, Rows n = 1..8, flattened
Wikipedia, Chromatic Polynomial

Columns 1-2 give: A000012, (-1)*A045944(n-1).
Row sums (for n>1) and last elements of rows give: A000004, row lengths give: A002522.
Cf. A000290, A212163, A212194.

A212163 Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is the number of n-colorings of the rhombic hexagonal square grid graph RH_(k,k).

Original entry on oeis.org

1, 0, 2, 0, 0, 3, 0, 0, 6, 4, 0, 0, 6, 48, 5, 0, 0, 6, 1056, 180, 6, 0, 0, 6, 45696, 32940, 480, 7, 0, 0, 6, 4034304, 30847500, 393600, 1050, 8, 0, 0, 6, 739642368, 148039757460, 3312560640, 2735250, 2016, 9

Offset: 1

Alois P. Heinz, May 02 2012

The rhombic hexagonal square grid graph RH_(n,n) has n^2 = A000290(n) vertices and (n-1)*(3*n-1) = A045944(n-1) edges; see A212162 for example. The chromatic polynomial of RH_(n,n) has n^2+1 = A002522(n) coefficients.

A differs from A212195 first at (n,k) = (4,5): A(4,5) = 4034304, A212195(4,5) = 4038432.

			Square array A(n,k) begins:
  1,    0,       0,            0,                 0, ...
  2,    0,       0,            0,                 0, ...
  3,    6,       6,            6,                 6, ...
  4,   48,    1056,        45696,           4034304, ...
  5,  180,   32940,     30847500,      148039757460, ...
  6,  480,  393600,   3312560640,   286169360240640, ...
  7, 1050, 2735250, 123791435250, 97337270132408250, ...

Andrew Howroyd, Table of n, a(n) for n = 1..153
Wikipedia, Chromatic Polynomial

Columns k=1-6 give: A000027, A047927(n) = 6*A002417(n-2), 6*A068244, 6*A068245, 6*A068246, 6*A068247.
Rows n=1-15 give: A000007, A000038, A040006, 4*A068271, 5*A068272, 6*A068273, 7*A068274, 8*A068275, 9*A068276, 10*A068277, 11*A068278, 12*A068279, 13*A068280, 14*A068281, 15*A068282.
Cf. A212162, A212195, A208054, A208050.

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

cp's OEIS Frontend

A033954 Second 10-gonal (or decagonal) numbers: n*(4*n+3).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

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

A147875 Second heptagonal numbers: a(n) = n*(5*n+3)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

Extensions

A001859 Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).

Views

Author

Keywords

Comments

Examples

References

Links

A033954 Second 10-gonal (or decagonal) numbers: n(4n+3).

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

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

A147875 Second heptagonal numbers: a(n) = n(5n+3)/2.

A303428 Number of ways to write n as x(3x-2) + y(3y-2) + 3^u + 3^v, where x,y,u,v are integers with x <= y and 0 <= u <= v.

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