A027468 -id:A027468 - cp's OEIS frontend

A033996 8 times triangular numbers: a(n) = 4n(n+1).

0, 8, 24, 48, 80, 120, 168, 224, 288, 360, 440, 528, 624, 728, 840, 960, 1088, 1224, 1368, 1520, 1680, 1848, 2024, 2208, 2400, 2600, 2808, 3024, 3248, 3480, 3720, 3968, 4224, 4488, 4760, 5040, 5328, 5624, 5928, 6240, 6560, 6888, 7224, 7568, 7920, 8280

Offset: 0

N. J. A. Sloane, Dec 11 1999

Write 0, 1, 2, ... in a clockwise spiral; sequence gives numbers on one of 4 diagonals.
Also, least m > n such that T(m)*T(n) is a square and more precisely that of A055112(n). {T(n) = A000217(n)}. - Lekraj Beedassy, May 14 2004
Also sequence found by reading the line from 0, in the direction 0, 8, ... and the same line from 0, in the direction 0, 24, ..., in the square spiral whose vertices are the generalized decagonal numbers A074377. Axis perpendicular to A195146 in the same spiral. - Omar E. Pol, Sep 18 2011
Number of diagonals with length sqrt(5) in an (n+1) X (n+1) square grid. Every 1 X 2 rectangle has two such diagonals. - Wesley Ivan Hurt, Mar 25 2015
Imagine a board made of squares (like a chessboard), one of whose squares is completely surrounded by square-shaped layers made of adjacent squares. a(n) is the total number of squares in the first to n-th layer. a(1) = 8 because there are 8 neighbors to the unit square; adding them gives a 3 X 3 square. a(2) = 24 = 8 + 16 because we need 16 more squares in the next layer to get a 5 X 5 square: a(n) = (2*n+1)^2 - 1 counting the (2n+1) X (2n+1) square minus the central square. - R. J. Cano, Sep 26 2015
The three platonic solids (the simplex, hypercube, and cross-polytope) with unit side length in n dimensions all have rational volume if and only if n appears in this sequence, after 0. - Brian T Kuhns, Feb 26 2016
The number of active (ON, black) cells in the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 645", based on the 5-celled von Neumann neighborhood. - Robert Price, May 19 2016
The square root of a(n), n>0, has continued fraction [2n; {1,4n}] with whole number part 2n and periodic part {1,4n}. - Ron Knott, May 11 2017
Numbers k such that k+1 is a square and k is a multiple of 4. - Bruno Berselli, Sep 28 2017
a(n) is the number of vertices of the octagonal network O(n,n); O(m,n) is defined by Fig. 1 of the Siddiqui et al. reference. - Emeric Deutsch, May 13 2018
a(n) is the number of vertices in conjoined n X n octagons which are arranged into a square array, a.k.a. truncated square tiling. - Donghwi Park, Dec 20 2020
a(n-2) is the number of ways to place 3 adjacent marks in a diagonal, horizontal, or vertical row on an n X n tic-tac-toe grid. - Matej Veselovac, May 28 2021

			Spiral with 0, 8, 24, 48, ... along lower right diagonal:
.
  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
   |   |   |   | \ |   |   |
  32  13   2---1   8  23  46
   |   |           | \ |   |
  31  12--11--10---9  24  47
   |                   | \ |
  30--29--28--27--26--25  48
                            \
[Reformatted by _Jon E. Schoenfield_, Dec 25 2016]

Stuart M. Ellerstein, J. Recreational Math. 29 (3) 188, 1998.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.
Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.

Ivan Panchenko, Table of n, a(n) for n = 0..1000
M. K. Siddiqui, M. Naeem, N. A. Rahman, and M. Imran, Computing topological indices of certain networks, J. of Optoelectronics and Advanced Materials, 18, No. 9-10, 2016, 884-892.
N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015.
Leo Tavares, Illustration: Centroid Diamonds.
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton.
Eric Weisstein's World of Mathematics, Hamiltonian Path.
Eric Weisstein's World of Mathematics, Knight Graph.
Stephen Wolfram, A New Kind of Science
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
Index entries for sequences related to cellular automata
Index to 2D 5-Neighbor Cellular Automata.
Index to Elementary Cellular Automata.

Cf. A000217, A016754, A002378, A024966, A027468, A028895, A028896, A045943, A046092, A049598, A088538, A124080, A008590 (first differences), A130809 (partial sums).
Sequences from spirals: A001107, A002939, A002943, A007742, A033951, A033952, A033953, A033954, A033988, A033989, A033990, A033991, A033996. - Omar E. Pol, Dec 12 2008
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.

[ 4*n*(n+1) : n in [0..50] ]; // Wesley Ivan Hurt, Jun 09 2014

seq(8*binomial(n+1, 2), n=0..46); # Zerinvary Lajos, Nov 24 2006
[seq((2*n+1)^2-1, n=0..46)];

Table[(2n - 1)^2 - 1, {n, 50}] (* Alonso del Arte, Mar 31 2013 *)

nsqm1(n) = { forstep(x=1,n,2, y = x*x-1; print1(y, ", ") ) }

a(n) = 4*n^2 + 4*n = (2*n+1)^2 - 1.
G.f.: 8*x/(1-x)^3.
a(n) = A016754(n) - 1 = 2*A046092(n) = 4*A002378(n). - Lekraj Beedassy, May 25 2004
a(n) = A049598(n) - A046092(n); a(n) = A124080(n) - A002378(n). - Zerinvary Lajos, Mar 06 2007
a(n) = 8*A000217(n). - Omar E. Pol, Dec 12 2008
a(n) = A005843(n) * A163300(n). - Juri-Stepan Gerasimov, Jul 26 2009
a(n) = a(n-1) + 8*n (with a(0)=0). - Vincenzo Librandi, Nov 17 2010
For n > 0, a(n) = A058031(n+1) - A062938(n-1). - Charlie Marion, Apr 11 2013
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Wesley Ivan Hurt, Mar 25 2015
a(n) = A000578(n+1) - A152618(n). - Bui Quang Tuan, Apr 01 2015
a(n) - a(n-1) = A008590(n), n > 0. - Altug Alkan, Sep 26 2015
From Ilya Gutkovskiy, May 19 2016: (Start)
E.g.f.: 4*x*(2 + x)*exp(x).
Sum_{n>=1} 1/a(n) = 1/4. (End)
Product_{n>=1} a(n)/A016754(n) = Pi/4. - Daniel Suteu, Dec 25 2016
a(n) = A056220(n) + A056220(n+1). - Bruce J. Nicholson, May 29 2017
sqrt(a(n)+1) - sqrt(a(n)) = (sqrt(n+1) - sqrt(n))^2. - Seiichi Manyama, Dec 23 2018
a(n)*a(n+k) + 4*k^2 = m^2 where m = (a(n) + a(n+k))/2 - 2*k^2; for k=1, m = 4*n^2 + 8*n + 2 = A060626(n). - Ezhilarasu Velayutham, May 22 2019
Sum_{n>=1} (-1)^n/a(n) = 1/4 - log(2)/2. - Vaclav Kotesovec, Dec 21 2020
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(4/Pi)*cos(Pi/sqrt(2)).
Product_{n>=1} (1 + 1/a(n)) = 4/Pi (A088538). (End)

A060544 Centered 9-gonal (also known as nonagonal or enneagonal) numbers. Every third triangular number, starting with a(1)=1.

Original entry on oeis.org

1, 10, 28, 55, 91, 136, 190, 253, 325, 406, 496, 595, 703, 820, 946, 1081, 1225, 1378, 1540, 1711, 1891, 2080, 2278, 2485, 2701, 2926, 3160, 3403, 3655, 3916, 4186, 4465, 4753, 5050, 5356, 5671, 5995, 6328, 6670, 7021, 7381, 7750, 8128, 8515, 8911, 9316

Offset: 1

Henry Bottomley, Apr 02 2001

Triangular numbers not == 0 (mod 3). - Amarnath Murthy, Nov 13 2005
Shallow diagonal of triangular spiral in A051682. - Paul Barry, Mar 15 2003
Equals the triangular numbers convolved with [1, 7, 1, 0, 0, 0, ...]. - Gary W. Adamson & Alexander R. Povolotsky, May 29 2009
a(n) is congruent to 1 (mod 9) for all n. The sequence of digital roots of the a(n) is A000012(n). The sequence of units' digits of the a(n) is period 20: repeat [1, 0, 8, 5, 1, 6, 0, 3, 5, 6, 6, 5, 3, 0, 6, 1, 5, 8, 0, 1]. - Ant King, Jun 18 2012
Divide each side of any triangle ABC with area (ABC) into 2n + 1 equal segments by 2n points: A_1, A_2, ..., A_(2n) on side a, and similarly for sides b and c. If the hexagon with area (Hex(n)) delimited by AA_n, AA_(n+1), BB_n, BB_(n+1), CC_n and CC_(n+1) cevians, we have a(n+1) = (ABC)/(Hex(n)) for n >= 1, (see link with java applet). - Ignacio Larrosa Cañestro, Jan 02 2015; edited by Wolfdieter Lang, Jan 30 2015
For the case n = 1 see the link for Marion's Theorem (actually Marion Walter's Theorem, see the Cugo et al, reference). Also, the generalization considered here has been called there (Ryan) Morgan's Theorem.  - Wolfdieter Lang, Jan 30 2015
Pollock states that every number is the sum of at most 11 terms of this sequence, but note that "1, 10, 28, 35, &c." has a typo (35 should be 55). - Michel Marcus, Nov 04 2017
a(n) is also the number of (nontrivial) paths as well as the Wiener sum index of the (n-1)-alkane graph. - Eric W. Weisstein, Jul 15 2021

T. D. Noe, Table of n, a(n) for n = 1..1000
Ignacio Larrosa Cañestro, Hexágono y estrella determinados por tres pares de cevianas simétricas, (java applet).
Al Cugo et al., Marion's theorem, The Mathematics Teacher 86 (1993) p. 619.
John Elias, Illustration of Initial Terms
F. Pollock, On the Extension of the Principle of Fermat's Theorem of the Polygonal Numbers to the Higher Orders of Series Whose Ultimate Differences Are Constant. With a New Theorem Proposed, Applicable to All the Orders, Abs. Papers Commun. Roy. Soc. London 5, 922-924, 1843-1850.
Eric Weisstein's World of Mathematics, Alkane Graph
Eric Weisstein's World of Mathematics, Graph Path
Eric Weisstein's World of Mathematics, Marion's Theorem
Eric Weisstein's World of Mathematics, Wiener Sum Index
Index entries for two-way infinite sequences
Index entries for sequences related to centered polygonal numbers
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001263, A027468, A081266, A190152.

List([1..50],n->(2*n-1)^2+(n-1)*n/2); # Muniru A Asiru, Mar 01 2019

[(2*n-1)^2+(n-1)*n/2: n in [1..50]]; // Vincenzo Librandi, Nov 18 2015

H := n -> simplify(1/hypergeom([-3*n,3*n+3,1],[3/2,2],3/4)); A060544 := n -> H(n-1); seq(A060544(i),i=1..19); # Peter Luschny, Jan 09 2012

Take[Accumulate[Range[150]], {1, -1, 3}] (* Harvey P. Dale, Mar 11 2013 *)
LinearRecurrence[{3, -3, 1}, {1, 10, 28}, 50] (* Harvey P. Dale, Mar 11 2013 *)
FoldList[#1 + #2 &, 1, 9 Range @ 50] (* Robert G. Wilson v, Feb 02 2011 *)
Table[(3 n - 1) (3 n - 2)/2, {n, 20}] (* Eric W. Weisstein, Jul 15 2021 *)
Table[Binomial[3 n - 1, 2], {n, 20}] (* Eric W. Weisstein, Jul 15 2021 *)
Table[PolygonalNumber[3 n - 2], {n, 20}] (* Eric W. Weisstein, Jul 15 2021 *)

PARI
```
a(n)=(3*n-1)*(3*n-2)/2
```

[(3*n-1)*(3*n-2)/2 for n in (1..50)] # G. C. Greubel, Mar 02 2019

a(n) = C(3*n, 3)/n = (3*n-1)*(3*n-2)/2 = A001504(n-1)/2.
a(n) = a(n-1) + 9*(n-1) = A060543(n, 3) = A006566(n)/n.
a(n) = A025035(n)/A025035(n-1) = A027468(n-1) + 1 = A000217(3*n-2).
a(1-n) = a(n).
From Paul Barry, Mar 15 2003: (Start)
a(n) = C(n-1, 0) + 9*C(n-1, 1) + 9*C(n-1, 2); binomial transform of (1, 9, 9, 0, 0, 0, ...).
a(n) = 9*A000217(n-1) + 1.
G.f.: x*(1 + 7*x + x^2)/(1-x)^3. (End)
Narayana transform (A001263) of [1, 9, 0, 0, 0, ...]. - Gary W. Adamson, Dec 29 2007
a(n-1) = Pochhammer(4,3*n)/(Pochhammer(2,n)*Pochhammer(n+1,2*n)).
a(n-1) = 1/Hypergeometric([-3*n,3*n+3,1],[3/2,2],3/4). - Peter Luschny, Jan 09 2012
From Ant King, Jun 18 2012: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
a(n) = 2*a(n-1) - a(n-2) + 9.
a(n) = A000217(n) + 7*A000217(n-1) + A000217(n-2).
Sum_{n>=1} 1/a(n) = 2*Pi/(3*sqrt(3)) = A248897.
(End)
a(n) = (2*n-1)^2 + (n-1)*n/2. - Ivan N. Ianakiev, Nov 18 2015
a(n) = A101321(9,n-1). - R. J. Mathar, Jul 28 2016
E.g.f.: (2 + 9*x^2)*exp(x)/2 - 1. - G. C. Greubel, Mar 02 2019
From Amiram Eldar, Jun 20 2020: (Start)
Sum_{n>=1} a(n)/n! = 11*e/2 - 1.
Sum_{n>=1} (-1)^n * a(n)/n! = 11/(2*e) - 1. (End)
a(n) = A000567(n) + A005449(n-1) (see illustration in links). - John Elias, Nov 10 2020
a(n) = P(2*n,4)*P(3*n,3)/24 for n>=2, where P(s,k) = ((s - 2)*k^2 - (s - 4)*k)/2 is the k-th s-gonal number. - Lechoslaw Ratajczak, Jul 18 2021

Additional description from Terrel Trotter, Jr., Apr 06 2002

Formulas by Paul Berry corrected for offset 1 by Wolfdieter Lang, Jan 30 2015

A035008 Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.

Original entry on oeis.org

0, 16, 48, 96, 160, 240, 336, 448, 576, 720, 880, 1056, 1248, 1456, 1680, 1920, 2176, 2448, 2736, 3040, 3360, 3696, 4048, 4416, 4800, 5200, 5616, 6048, 6496, 6960, 7440, 7936, 8448, 8976, 9520, 10080, 10656, 11248, 11856, 12480, 13120, 13776

Offset: 0

Ulrich Schimke (ulrschimke(AT)aol.com), Dec 11 1999

16 times the triangular numbers A000217.
Centered 16-gonal numbers A069129, minus 1. Also, sequence found by reading the segment (0, 16) together with the line from 16, in the direction 16, 48, ..., in the square spiral whose vertices are the triangular numbers A000217. - Omar E. Pol, Apr 26 2008, Nov 20 2008
For n >= 1, number of permutations of n+1 objects selected from 5 objects v, w, x, y, z with repetition allowed, containing n-1 v's. Examples: at n=1, n-1=0 (i.e., zero v's), and a(1)=16 because we have ww, wx, wy, wz, xw, xx, xy, xz, yw, yx, yy, yz, zw, zx, zy, zz; at n=2, n-1=1 (i.e., one v), and there are 3 permutations corresponding to each one in the n=1 case (e.g., the single v can be inserted in any of three places in the 2-object permutation xy, yielding vxy, xvy, and xyv), so a(2) = 3*a(1) = 3*16 = 48; at n=3, n-1=2 (i.e., two v's), and a(3) = C(4,2)*a(1) = 6*16 = 96; etc. - Zerinvary Lajos, Aug 07 2008 (this needs clarification, Joerg Arndt, Feb 23 2014)
Sequence found by reading the line from 0, in the direction 0, 16, ... and the same line from 0, in the direction 0, 48, ..., in the square spiral whose vertices are the generalized 18-gonal numbers. - Omar E. Pol, Oct 03 2011
For n > 0, a(n) is the area of the triangle with vertices at ((n-1)^2, n^2), ((n+1)^2, (n+2)^2), and ((n+3)^2, (n+2)^2). - J. M. Bergot, May 22 2014
For n > 0, a(n) is the number of self-intersecting points in star polygon {4*(n+1)/(2*n+1)}. - Bui Quang Tuan, Mar 28 2015
Equivalently: integers k such that k$ / (k/2)! and k$ / (k/2+1)! are both squares when A000178 (k) = k$ = 1!*2!*...*k! is the superfactorial of k (see A348692 for further information). - Bernard Schott, Dec 02 2021

			3 X 3-Board: knight can be placed in 8 positions with 2 moves from each, so a(1) = 16.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Eric Weisstein's World of Mathematics, Star Polygon.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A033586 (King), A035005 (Queen), A035006 (Rook), A002492 (Bishop) and A049450 (Pawn).
Cf. A000217, A069129, A027468, A008586 A038231, A002378, A033996, A046092.
Cf. A348692.
Subsequence of A008586 and of A349081.

[8*n*(n+1): n in [0..50]]; // Wesley Ivan Hurt, May 22 2014

seq(binomial(n+1,2)*4^2, n=0..33); # Zerinvary Lajos, Aug 07 2008

CoefficientList[Series[16 x/(1 - x)^3, {x, 0, 40}], x] (* Vincenzo Librandi, Feb 24 2014 *)
LinearRecurrence[{3,-3,1},{0,16,48},50] (* or *) 16*Accumulate[ Range[ 0,50]] (* Harvey P. Dale, Aug 05 2018 *)

a(n)=8*n*(n+1) \\ Charles R Greathouse IV, Sep 30 2015

a(n) = 8*n*(n+1).
G.f.: 16*x/(1-x)^3.
a(n) = A069129(n+1) - 1. - Omar E. Pol, Apr 26 2008
a(n) = binomial(n+1,2)*4^2, n >= 0. - Zerinvary Lajos, Aug 07 2008
a(n) = 8*n^2 + 8*n = 16*A000217(n) = 8*A002378(n) = 4*A046092(n) = 2*A033996(n). - Omar E. Pol, Dec 12 2008
a(n) = a(n-1) + 16*n, with a(0)=0. - Vincenzo Librandi, Nov 17 2010
E.g.f.: 8*exp(x)*x*(2 + x). - Stefano Spezia, May 19 2021
From Amiram Eldar, Feb 22 2023: (Start)
Sum_{n>=1} 1/a(n) = 1/8.
Sum_{n>=1} (-1)^(n+1)/a(n) = (2*log(2) - 1)/8.
Product_{n>=1} (1 - 1/a(n)) = -(8/Pi)*cos(sqrt(3/2)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (8/Pi)*cos(Pi/(2*sqrt(2))). (End)

More terms from Erich Friedman

Minor errors corrected and edited by Johannes W. Meijer, Feb 04 2010

A049598 12 times triangular numbers.

Original entry on oeis.org

0, 12, 36, 72, 120, 180, 252, 336, 432, 540, 660, 792, 936, 1092, 1260, 1440, 1632, 1836, 2052, 2280, 2520, 2772, 3036, 3312, 3600, 3900, 4212, 4536, 4872, 5220, 5580, 5952, 6336, 6732, 7140, 7560, 7992, 8436, 8892, 9360, 9840, 10332, 10836, 11352

Offset: 0

Joe Keane (jgk(AT)jgk.org)

a(n-1) is the Wiener index of the helm graph H(n) (n>=3). The graph H(n) is obtained from an n-wheel graph (on n+1 nodes) by adjoining a pendant edge at each node of the cycle. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph. The Wiener polynomial of H(n) is (1/2)*n*t*((n-3)t^3 + 2(n-2)t^2 + (n+3)t + 6). - Emeric Deutsch, Sep 28 2010
Also sequence found by reading the line from 0, in the direction 0, 12, ..., and the same line from 0, in the direction 0, 36, ..., in the square spiral whose vertices are the generalized tetradecagonal numbers A195818. Axis perpendicular to A195158 in the same spiral. - Omar E. Pol, Sep 29 2011
Also the Wiener index of the (n+1)-gear graph. - Eric W. Weisstein, Sep 08 2017

			a(1) = 12*1 + 0 = 12;
a(2) = 12*2 + 12 = 36;
a(3) = 12*3 + 36 = 72.

G. C. Greubel, Table of n, a(n) for n = 0..5000
B. E. Sagan, Y-N. Yeh and P. Zhang, The Wiener Polynomial of a Graph, Internat. J. of Quantum Chem., Vol. 60 (1996), pp. 959-969.
Leo Tavares, Illustration: Centroid Stars.
Eric Weisstein's World of Mathematics, Gear Graph.
Eric Weisstein's World of Mathematics, Helm Graph.
Eric Weisstein's World of Mathematics, Wiener Index.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A001844, A003154, A027468, A035008, A073577.

12 * Accumulate[Range[0, 50]] (* Harvey P. Dale, Feb 05 2013 *)
(* Start from Eric W. Weisstein, Sep 08 2017 *)
Table[6 n (n + 1), {n, 0, 20}]
12 PolygonalNumber[3, Range[0, 20]]
12 Binomial[Range[20], 2]
LinearRecurrence[{3, -3, 1}, {12, 36, 72}, {0, 20}]
(* End *)

a(n)=6*n*(n+1) \\ Charles R Greathouse IV, Jun 17 2017

a(n) = 6*n*(n+1).
G.f.: 12*x/(1-x)^3.
a(n) = 12*A000217(n). - Omar E. Pol, Dec 11 2008
a(n) = 12*n + a(n-1) (with a(0)=0). - Vincenzo Librandi, Aug 06 2010
a(n) = A003154(n+1) - 1. - Omar E. Pol, Oct 03 2011
a(n) = A032528(2*n+1) - 1. - Adriano Caroli, Jul 19 2013
a(n) = A001844(n) + A073577(n). - Bruce J. Nicholson, Aug 06 2017
E.g.f.: 6*x*(x+2)*exp(x). - G. C. Greubel, Aug 23 2017
From Amiram Eldar, Feb 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/6.
Sum_{n>=1} (-1)^(n+1)/a(n) = log(2)/3 - 1/6. (End)
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(6/Pi)*cos(sqrt(5/3)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (6/Pi)*cos(Pi/(2*sqrt(3))). (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

A124080 10 times triangular numbers: a(n) = 5n(n + 1).

Original entry on oeis.org

0, 10, 30, 60, 100, 150, 210, 280, 360, 450, 550, 660, 780, 910, 1050, 1200, 1360, 1530, 1710, 1900, 2100, 2310, 2530, 2760, 3000, 3250, 3510, 3780, 4060, 4350, 4650, 4960, 5280, 5610, 5950, 6300, 6660, 7030, 7410, 7800, 8200, 8610, 9030, 9460, 9900, 10350

Offset: 0

Zerinvary Lajos, Nov 24 2006

If Y is a 5-subset of an n-set X then, for n >= 5, a(n-4) is equal to the number of 5-subsets of X having exactly three elements in common with Y. Y is a 5-subset of an n-set X then, for n >= 6, a(n-6) is the number of (n-5)-subsets of X having exactly two elements in common with Y. - Milan Janjic, Dec 28 2007

Also sequence found by reading the line from 0, in the direction 0, 10, ... and the same line from 0, in the direction 0, 30, ..., in the square spiral whose vertices are the generalized dodecagonal numbers A195162. Axis perpendicular to A195148 in the same spiral. - Omar E. Pol, Sep 18 2011

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

Cf. A028895, A046092, A045943, A002378, A028896, A024966, A033996, A027468, A049598, A000217.

[ 5*n*(n+1) : n in [0..50] ]; // Wesley Ivan Hurt, Jun 09 2014

[seq(10*binomial(n,2),n=1..51)];
seq(n*(n+1)*5, n=0..39); # Zerinvary Lajos, Mar 06 2007

10*Accumulate[Range[0,50]] (* or *) LinearRecurrence[{3,-3,1},{0,10,30},50] (* Harvey P. Dale, Jul 21 2011 *)

a(n)=5*n*(n+1) \\ Charles R Greathouse IV, Sep 28 2015

a(n) = 10*C(n,2), n >= 1.
a(n) = A049598(n) - A002378(n). - Zerinvary Lajos, Mar 06 2007
a(n) = 5*n*(n + 1), n >= 0. - Zerinvary Lajos, Mar 06 2007
a(n) = 5*n^2 + 5*n = 10*A000217(n) = 5*A002378(n) = 2*A028895(n). - Omar E. Pol, Dec 12 2008
a(n) = 10*n + a(n-1) (with a(0) = 0). - Vincenzo Librandi, Nov 12 2009
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3), a(0) = 0, a(1) = 10, a(2) = 30. - Harvey P. Dale, Jul 21 2011
a(n) = A062786(n+1) - 1. - Omar E. Pol, Oct 03 2011
a(n) = A131242(10*n+9). - Philippe Deléham, Mar 27 2013
From G. C. Greubel, Aug 22 2017: (Start)
G.f.: 10*x/(1 - x)^3.
E.g.f.: 5*x*(x + 2)*exp(x). (End)
From Amiram Eldar, Sep 04 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/5.
Sum_{n>=1} (-1)^(n+1)/a(n) = (2*log(2)-1)/5. (End)
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(5/Pi)*cos(3*Pi/(2*sqrt(5))).
Product_{n>=1} (1 + 1/a(n)) = (5/Pi)*cos(Pi/(2*sqrt(5))). (End)

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

A195147 Concentric 18-gonal numbers.

Original entry on oeis.org

0, 1, 18, 37, 72, 109, 162, 217, 288, 361, 450, 541, 648, 757, 882, 1009, 1152, 1297, 1458, 1621, 1800, 1981, 2178, 2377, 2592, 2809, 3042, 3277, 3528, 3781, 4050, 4321, 4608, 4897, 5202, 5509, 5832, 6157, 6498, 6841, 7200, 7561, 7938, 8317, 8712, 9109

Offset: 0

Omar E. Pol, Sep 17 2011

Concentric octadecagonal numbers or concentric octakaidecagonal numbers.

Sequence found by reading the line from 0, in the direction 0, 18, ..., and the same line from 1, in the direction 1, 37, ..., in the square spiral whose vertices are the generalized hendecagonal numbers A195160. Main axis, perpendicular to A027468 in the same spiral.

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

A195321 and A195316 interleaved.
Cf. A032528, A077221, A195142, A195143, A195145, A195146, A195148, A195149.
Cf. A032527, A195047, A195048. Column 18 of A195040. - Omar E. Pol, Sep 29 2011

[(18*n^2+7*(-1)^n-7)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

LinearRecurrence[{2, 0, -2, 1}, {0, 1, 18, 37}, 50] (* Amiram Eldar, Jan 17 2023 *)

a(n)=(18*n^2+7*(-1)^n-7)/4 \\ Charles R Greathouse IV, Sep 28 2015

G.f.: -x*(1+16*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
From Vincenzo Librandi, Sep 27 2011: (Start)
a(n) = (18*n^2 + 7*(-1)^n - 7)/4;
a(n) = -a(n-1) + 9*n^2 - 9*n + 1. (End)
Sum_{n>=1} 1/a(n) = Pi^2/108 + tan(sqrt(7)*Pi/6)*Pi/(6*sqrt(7)). - Amiram Eldar, Jan 17 2023

A069131 Centered 18-gonal numbers.

Original entry on oeis.org

1, 19, 55, 109, 181, 271, 379, 505, 649, 811, 991, 1189, 1405, 1639, 1891, 2161, 2449, 2755, 3079, 3421, 3781, 4159, 4555, 4969, 5401, 5851, 6319, 6805, 7309, 7831, 8371, 8929, 9505, 10099, 10711, 11341, 11989, 12655, 13339, 14041, 14761, 15499, 16255, 17029, 17821

Offset: 1

Terrel Trotter, Jr., Apr 07 2002

Equals binomial transform of [1, 18, 18, 0, 0, 0, ...]. Example: a(3) = 55 = (1, 2, 1) dot (1, 18, 18) = (1 + 36 + 18). - Gary W. Adamson, Aug 24 2010
Narayana transform (A001263) of [1, 18, 0, 0, 0, ...]. - Gary W. Adamson, Jul 28 2011
From Lamine Ngom, Aug 19 2021: (Start)
Sequence is a spoke of the hexagonal spiral built from the terms of A016777 (see illustration in links section).
a(n) is a bisection of A195042.
a(n) is a trisection of A028387.
a(n) + 1 is promic (A002378).
a(n) + 2 is a trisection of A002061.
a(n) + 9 is the arithmetic mean of its neighbors.
4*a(n) + 5 is a square: A016945(n)^2. (End)

			a(5) = 181 because 9*5^2 - 9*5 + 1 = 225 - 45 + 1 = 181.

Ivan Panchenko, Table of n, a(n) for n = 1..1000
John Elias, Illustration of Initial Terms: Triangular & Hexagonal Configurations.
Lamine Ngom, An origin of A069131 (illustration).
Leo Tavares, Illustration: Tri-Hexagons.
Eric Weisstein's World of Mathematics, Centered Polygonal Numbers.
R. Yin, J. Mu, and T. Komatsu, The p-Frobenius Number for the Triple of the Generalized Star Numbers, Preprints 2024, 2024072280. See p. 2.
Index entries for sequences related to centered polygonal numbers.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. centered polygonal numbers listed in A069190.
Cf. A000217, A028387, A195042, A016945, A002378, A082040, A304163, A003215, A247792, A016777,A016778, A016790, A010008, A008600, A002061.
Cf. A000290, A139278, A069129, A062786, A033996, A060544, A027468, A016754, A124080, A069099, A152740, A049598, A005891, A152741, A001844, A163756, A005448, A194715.

[9*n^2 - 9*n + 1 : n in [1..50]]; // Wesley Ivan Hurt, May 05 2021

FoldList[#1 + #2 &, 1, 18 Range@ 45] (* Robert G. Wilson v, Feb 02 2011 *)
LinearRecurrence[{3,-3,1},{1,19,55},50] (* Harvey P. Dale, Jan 20 2014 *)

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

a(n) = 9*n^2 - 9*n + 1.
a(n) = 18*n + a(n-1) - 18 (with a(1)=1). - Vincenzo Librandi, Aug 08 2010
G.f.: ( x*(1+16*x+x^2) ) / ( (1-x)^3 ). - R. J. Mathar, Feb 04 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(1)=1, a(2)=19, a(3)=55. - Harvey P. Dale, Jan 20 2014
From Amiram Eldar, Jun 21 2020: (Start)
Sum_{n>=1} 1/a(n) = Pi*tan(sqrt(5)*Pi/6)/(3*sqrt(5)).
Sum_{n>=1} a(n)/n! = 10*e - 1.
Sum_{n>=1} (-1)^n * a(n)/n! = 10/e - 1. (End)
From Lamine Ngom, Aug 19 2021: (Start)
a(n) = 18*A000217(n) + 1 = 9*A002378(n) + 1.
a(n) = 3*A003215(n) - 2.
a(n) = A247792(n) - 9*n.
a(n) = A082040(n) + A304163(n) - a(n-1) = A016778(n) + A016790(n) - a(n-1), n > 0.
a(n) + a(n+1) = 2*A247792(n) = A010008(n), n > 0.
a(n+1) - a(n) = 18*n = A008600(n). (End)
From Leo Tavares, Oct 31 2021: (Start)
a(n)= A000290(n) + A139278(n-1)
a(n) = A069129(n) + A002378(n-1)
a(n) = A062786(n) + 8*A000217(n-1)
a(n) = A062786(n) + A033996(n-1)
a(n) = A060544(n) + 9*A000217(n-1)
a(n) = A060544(n) + A027468(n-1)
a(n) = A016754(n-1) + 10*A000217(n-1)
a(n) = A016754(n-1) + A124080
a(n) = A069099(n) + 11*A000217(n-1)
a(n) = A069099(n) + A152740(n-1)
a(n) = A003215(n-1) + 12*A000217(n-1)
a(n) = A003215(n-1) + A049598(n-1)
a(n) = A005891(n-1) + 13*A000217(n-1)
a(n) = A005891(n-1) + A152741(n-1)
a(n) = A001844(n) + 14*A000217(n-1)
a(n) = A001844(n) + A163756(n-1)
a(n) = A005448(n) + 15*A000217(n-1)
a(n) = A005448(n) + A194715(n-1). (End)
E.g.f.: exp(x)*(1 + 9*x^2) - 1. - Nikolaos Pantelidis, Feb 06 2023

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

Original entry on oeis.org

1, 4, 16, 37, 67, 106, 154, 211, 277, 352, 436, 529, 631, 742, 862, 991, 1129, 1276, 1432, 1597, 1771, 1954, 2146, 2347, 2557, 2776, 3004, 3241, 3487, 3742, 4006, 4279, 4561, 4852, 5152, 5461, 5779, 6106, 6442, 6787, 7141, 7504, 7876, 8257, 8647, 9046

Offset: 0

Paul Barry, Feb 23 2003

The old definition of this sequence was "Generalized polygonal numbers".
Row T(3,n) of A080853.
Equals binomial transform of [1, 3, 9, 0, 0, 0, ...] - Gary W. Adamson, Apr 30 2008
a(n) is also the least weight of self-conjugate partitions having n different parts such that each part is congruent to 2 modulo 3. The first such self-conjugate partitions, corresponding to a(n)=1,2,3,4, are 2+2, 5+5+2+2+2, 8+8+5+5+5+2+2+2, 11+11+8+8+8+5+5+5+2+2+2. - Augustine O. Munagi, Dec 18 2008
Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=3, (i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n >= 3, a(n-1) = -coeff(charpoly(A,x), x^(n-2)). - Milan Janjic, Jan 27 2010

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Milan Janjić, Hessenberg Matrices and Integer Sequences, J. Int. Seq. 13 (2010) # 10.7.8.
A. O. Munagi, Pairing conjugate partitions by residue classes, Discrete Math., 308 (2008), 2492-2501.
Franck Ramaharo, Statistics on some classes of knot shadows, arXiv:1802.07701 [math.CO], 2018.
Leo Tavares, Illustration: Hexagonal Tri-Rays
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A027468, A038764.
Cf. A283394 (see Crossrefs section).
Cf. A003215, A000217, A227776.

List([0..50],n->(9*n^2-3*n+2)/2); # Muniru A Asiru, Nov 02 2018

[(9*n^2 - 3*n +2)/2: n in [0..50]]; // G. C. Greubel, Nov 02 2018

seq((9*n^2-3*n+2)/2,n=0..50); # Muniru A Asiru, Nov 02 2018

s = 1; lst = {s}; Do[s += n + 2; AppendTo[lst, s], {n, 1, 500, 9}]; lst (* Zerinvary Lajos, Jul 11 2009 *)
Table[(9n^2-3n+2)/2,{n,0,50}] (* or *) LinearRecurrence[{3,-3,1}, {1,4,16}, 50] (* Harvey P. Dale, Jul 24 2013 *)

a(n)=binomial(3*n,2)+1 \\ Charles R Greathouse IV, Oct 07 2015

G.f.: (1 + x + 7*x^2)/(1 - x)^3.
a(n) = 9*n + a(n-1) - 6 with n > 0, a(0)=1. - Vincenzo Librandi, Aug 08 2010
a(n) = n*A005448(n+1) - (n-1)*A005448(n), with A005448(0)=1. - Bruno Berselli, Jan 15 2013
a(0)=1, a(1)=4, a(2)=16; for n > 2, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Jul 24 2013
a(n) = A152947(3*n+1). - Franck Maminirina Ramaharo, Jan 10 2018
E.g.f.: (2 + 6*x + 9*x^2)*exp(x)/2. - G. C. Greubel, Nov 02 2018
From Leo Tavares, Feb 20 2022: (Start)
a(n) = A003215(n-1) + 3*A000217(n). See Hexagonal Tri-Rays illustration in links.
a(n) = A227776(n) - 3*A000217(n). (End)

Definition replaced with the closed form by Bruno Berselli, Jan 15 2013

cp's OEIS Frontend

A033996 8 times triangular numbers: a(n) = 4*n*(n+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A060544 Centered 9-gonal (also known as nonagonal or enneagonal) numbers. Every third triangular number, starting with a(1)=1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A035008 Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A049598 12 times triangular numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

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

A124080 10 times triangular numbers: a(n) = 5*n*(n + 1).

Views

Author

Keywords

Comments

Links

A033996 8 times triangular numbers: a(n) = 4n(n+1).

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

A124080 10 times triangular numbers: a(n) = 5n(n + 1).

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