A001082 -id:A001082 - cp's OEIS frontend

A195818 Generalized 14-gonal numbers: m(6m-5), m = 0,+1,-1,+2,-2,+3,-3,...

0, 1, 11, 14, 34, 39, 69, 76, 116, 125, 175, 186, 246, 259, 329, 344, 424, 441, 531, 550, 650, 671, 781, 804, 924, 949, 1079, 1106, 1246, 1275, 1425, 1456, 1616, 1649, 1819, 1854, 2034, 2071, 2261, 2300, 2500, 2541, 2751, 2794, 3014, 3059, 3289

Offset: 0

Omar E. Pol, Sep 29 2011

Also generalized tetradecagonal numbers or generalized tetrakaidecagonal numbers.
Also A211014 and positive terms of A051866 interleaved. - Omar E. Pol, Aug 04 2012
Exponents in expansion of Product_{n >= 1} (1 + x^(12*n-11))*(1 + x^(12*n-1))*(1 - x^(12*n)) = 1 + x + x^11 + x^14 + x^34 + .... - Peter Bala, Dec 10 2020

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

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

[(3*n*(n+1)+(2*n+1)*(-1)^n-1)/2: n in [0..60]]; // Vincenzo Librandi, Sep 30 2011

A195818:=func; [0] cat [A195818(n*m): m in [1,-1], n in [1..25]];

a:= n-> (m-> m*(6*m-5))(ceil(-(n+1)/2)*(-1)^n):
seq(a(n), n=0..46);  # Alois P. Heinz, Jun 08 2021

LinearRecurrence[{1,2,-2,-1,1},{0,1,11,14,34},50] (* Harvey P. Dale, Mar 13 2018 *)

Vec(-x*(x^2+10*x+1)/((x-1)^3*(x+1)^2) + O(x^100)) \\ Colin Barker, Sep 15 2013

a(n) = (3*n*(n+1) + (2*n+1)*(-1)^n - 1)/2. - Vincenzo Librandi, Sep 30 2011
G.f.: -x*(x^2+10*x+1) / ((x-1)^3*(x+1)^2). - Colin Barker, Sep 15 2013
Sum_{n>=1} 1/a(n) = 6/25 + sqrt(3)*Pi/5. - Vaclav Kotesovec, Oct 05 2016
E.g.f.: (x*(3*x + 4)*cosh(x) + (3*x^2 + 8*x - 2)*sinh(x))/2. - Stefano Spezia, Jun 08 2021
Sum_{n>=1} (-1)^(n+1)/a(n) = (5*log(432)-6)/25. - Amiram Eldar, Feb 28 2022

A054000 a(n) = 2*n^2 - 2.

Original entry on oeis.org

0, 6, 16, 30, 48, 70, 96, 126, 160, 198, 240, 286, 336, 390, 448, 510, 576, 646, 720, 798, 880, 966, 1056, 1150, 1248, 1350, 1456, 1566, 1680, 1798, 1920, 2046, 2176, 2310, 2448, 2590, 2736, 2886, 3040, 3198, 3360, 3526, 3696, 3870, 4048, 4230, 4416

Offset: 1

Asher Auel, Jan 12 2000

a(n) is the number of edges in (n+1) X (n+1) square grid with all horizontal, vertical and great diagonal segments filled in.
Nonnegative X values of integer solutions to the equation 2*X^3 + 4*X^2 = Y^2. To find Y values: b(n) = 2*n*(2*n^2 - 2). - Mohamed Bouhamida, Nov 06 2007
Second term of an arithmetic progression of 5 numbers with common difference 2n+1. The sum of squares of such 5 terms equals the sum of squares of 5 consecutive numbers starting a(n) + 2n + 1. - Carmine Suriano, Oct 16 2013
For m > 2, a(m-1) = 2*m*(m-2) is the number of Hamiltonian circuits on an m-gonal bipyramid with labeled vertices. - Stanislav Sykora, Jul 22 2014
a(n+1), n >= 0, appears also as the third member of the quartet [p0(n), p1(n), a(n+1), p3(n)] of the square of [n, n+1, n+2, n+3] in the Clifford algebra Cl_2 for n >= 0. p0(n) = -A147973(n+3), p1(n) = A046092(n) and p3(n) = A139570(n). See a comment on A147973, also with a reference. - Wolfdieter Lang, Oct 15 2014
From Bui Quang Tuan, Mar 31 2015: (Start)
For n >= 2, a(n) is the total sum of all numbers on the perimeter of a square consisting of n columns, each of which contains n numbers 1, 2, 3, ..., n.
Here is an example with n = 5:
  1 1 1 1 1
  2 2 2 2 2
  3 3 3 3 3
  4 4 4 4 4
  5 5 5 5 5
where 1+1+1+1+1 + 2+2 + 3+3 + 4+4 + 5+5+5+5+5 = 48 = a(5).
(End)
Nonnegative k such that k/2+1 is a square. - Bruno Berselli, Apr 10 2018

			For n=5, a(5)=48 and 37^2 + 48^2 + 59^2 + 70^2 + 81^2 = 59^2 + 60^2 + 61^2 + 62^2 + 63^2. - _Carmine Suriano_, Oct 16 2013

G. C. Greubel, Table of n, a(n) for n = 1..5000
Milan Janjić, Pascal Matrices and Restricted Words, J. Int. Seq., Vol. 21 (2018), Article 18.5.2.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

a(n) = A100345(n+1, n-4) for n>2.

Cf. A000217, A001082, A002378, A002943, A005563, A028347, A036666, A046092, A056220, A062717, A067725, A087475.

Maple
```
[ seq(2*n^2 - 2, n=1..60) ];
```

2 Range[50]^2 - 2 (* or *) LinearRecurrence[{3, -3, 1}, {0, 6, 16}, 50] (* Harvey P. Dale, Feb 03 2012 *)
CoefficientList[Series[2 x (3 - x) / (1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Apr 01 2015 *)

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

a(n) = 4*n + a(n-1) - 2, with n>1, a(1)=0. - Vincenzo Librandi, Aug 06 2010
a(1)=0, a(2)=6, a(3)=16; for n>3, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Feb 03 2012
a(n) = (n+i)^2 + (n-i)^2, where i=sqrt(-1). - Bruno Berselli, Jan 23 2014
a(n) = 1*A000290(n-1) + 2*A000217(n-1) + 3*A001477(n-1). - J. M. Bergot, Apr 23 2014
G.f.: 2*x^2*(3 - x)/(1 - x)^3. - Vincenzo Librandi, Apr 01 2015
E.g.f.: 2*(x^2 + x -1)*exp(x) + 2. - G. C. Greubel, Jul 13 2017
a(n) + a(n+2) = A005843(n+1)^2. - Ezhilarasu Velayutham, May 30 2019
From Amiram Eldar, Dec 09 2021: (Start)
Sum_{n>=2} 1/a(n) = 3/8.
Sum_{n>=2} (-1)^n/a(n) = 1/8. (End)

A087475 a(n) = n^2 + 4.

Original entry on oeis.org

4, 5, 8, 13, 20, 29, 40, 53, 68, 85, 104, 125, 148, 173, 200, 229, 260, 293, 328, 365, 404, 445, 488, 533, 580, 629, 680, 733, 788, 845, 904, 965, 1028, 1093, 1160, 1229, 1300, 1373, 1448, 1525, 1604, 1685, 1768, 1853, 1940, 2029, 2120, 2213, 2308, 2405, 2504

Offset: 0

Gary W. Adamson, Sep 09 2003

Schroeder, p. 330, states "For positive n, these winding numbers are precisely those whose continued fraction expansion is periodic and has period length 1".
Positive X values of solutions to the equation X^3 - 4*X^2 = Y^2. To find Y values: b(n) = n*(n^2 + 4). - Mohamed Bouhamida, Nov 06 2007
From Artur Jasinski, Oct 03 2008: (Start)
General formula for cotangent recurrences type:
a(n+1) = a(n)^3 + 3*a(n) and a(1)=k is
a(n) = floor(((k + sqrt(k^2 + 4))/2)^(3^(n-1))). (End)
Given sequences of the form S(n) = N*S(n-1) + S(n-2) starting (1, N, ...), and having convergents with discriminant (N^2 + 4), S(p) == (a(n))^((p-1)/2) mod p, for n>0, p = odd prime. Example: with N = 2 we have the Pell series (1, 2, 5, 12, 29, 70, 169, ...) with P(7) = 169. Then 169 == 8^3 mod 7, with a(2) = 8. Cf. Schroeder, "Number Theory in Science and Communication", p. 90, for N = 1: F(p) == 5^((p-1)/2) mod p. - Gary W. Adamson, Feb 23 2009
The only two real solutions of the form f(x) = A*x^p with positive p that satisfy f^(n)(x) = f^[-1](x), x >= 0, n >= 1, with f^(n) the n-th derivative and f^[-1] the compositional inverse of f, are obtained for p = p1(n) = (n + sqrt(a(n)))/2 and p = p2(n) = (n - sqrt(a(n)))/2, n >= 1, and A = A(n) = (fallfac(p,n))^(-p/(p+1)), for p = p1(n) and p = p2(n), respectively. Here fallfac(x, k) := product(x - j, j = 0..k-1), the falling factorials. See the T. Koshy reference, pp. 263-264 (there is also a solution for negative p if n is even; see the corresponding comment in A002522). - Wolfdieter Lang, Oct 21 2010, Oct 28 2010
(n + sqrt(a(n)))/2 = [n;n,n,...], with the regular continued fraction with period length 1. For a simple proof see, e.g., the Schroeder reference, pp. 330-331. See also the first comment above.

			a(2) = 8, discriminant of algebraic representation of barover(2) = [2,2,2,...] = sqrt 2 - 1 = 0.41421356... = ((sqrt 8) - 2)/2. a(3) = 13, discriminant of barover(3) = [3,3,3,...] = 0.3027756... = ((sqrt 13) - 3)/2.

Manfred R. Schroeder, "Fractals, Chaos, Power Laws"; W.H. Freeman & Co, 1991, p. 330-331.
Manfred R. Schroeder, "Number Theory in Science and Communication", Springer Verlag, 5th ed., 2009. [From Gary W. Adamson, Feb 23 2009]
Thomas Koshy, "Fibonacci and Lucas Numbers with Applications", John Wiley and Sons, New York, 2001. [From Wolfdieter Lang, Oct 21 2010]

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Near-Square Prime.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001082, A002378, A002522, A005563, A028347, A036666, A046092, A053755, A062717, A155965, A155966, A156701, A156798.

Range[0, 50]^2 + 4 (* Harvey P. Dale, Jan 05 2011 *)

a(n)=n^2+4 \\ Charles R Greathouse IV, Jun 10 2011

(0 to 49).map(n => n * n + 4) // Alonso del Arte, May 29 2019

n^2 + 4 are discriminant terms in the formula for Positive Silver Mean Constants, defined as barover(n), = (sqrt (n^2 + 4) - n)/2. Such constants barover(n) = C have the property: 1/C - C = n.
a(n) = A156701(n) / A053755(n). - Reinhard Zumkeller, Feb 13 2009
a(n) = A156798(n)/A002522(n). - Reinhard Zumkeller, Feb 16 2009
a(n) = a(n-1) + 2*n-1 (with a(0)=4). - Vincenzo Librandi, Nov 22 2010
G.f.: (4 - 7*x + 5*x^2)/(1 - x)^3. - Colin Barker, Jan 06 2012
a(n)^3 = A155965(n)^2 + A155966(n)^2. - Vincenzo Librandi, Feb 22 2012
From Amiram Eldar, Jul 13 2020: (Start)
Sum_{n>=0} 1/a(n) = (1 + 2*Pi*coth(2*Pi))/8.
Sum_{n>=0} (-1)^n/a(n) = (1 + 2*Pi*cosech(2*Pi))/8 = A371803. (End)
E.g.f.: exp(x)*(4 + x + x^2). - Stefano Spezia, Jul 08 2023
From Amiram Eldar, Feb 05 2024: (Start)
Product_{n>=0} (1 - 1/a(n)) = sqrt(3)*sinh(sqrt(3)*Pi)/(2*sinh(2*Pi)).
Product_{n>=0} (1 + 1/a(n)) = sqrt(5)*sinh(sqrt(5)*Pi)/(2*sinh(2*Pi)). (End)

A028896 6 times triangular numbers: a(n) = 3n(n+1).

Original entry on oeis.org

0, 6, 18, 36, 60, 90, 126, 168, 216, 270, 330, 396, 468, 546, 630, 720, 816, 918, 1026, 1140, 1260, 1386, 1518, 1656, 1800, 1950, 2106, 2268, 2436, 2610, 2790, 2976, 3168, 3366, 3570, 3780, 3996, 4218, 4446, 4680, 4920, 5166, 5418, 5676

Offset: 0

Joe Keane (jgk(AT)jgk.org), Dec 11 1999

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, 6, ...
The spiral begins:
                 85--84--83--82--81--80
                 /                     \
               86  56--55--54--53--52  79
               /   /                 \   \
             87  57  33--32--31--30  51  78
             /   /   /             \   \   \
           88  58  34  16--15--14  29  50  77
           /   /   /   /         \   \   \   \
         89  59  35  17   5---4  13  28  49  76
         /   /   /   /   /     \   \   \   \   \
    <==90==60==36==18===6===0   3  12  27  48  75
           /   /   /   /   /   /   /   /   /   /
         61  37  19   7   1---2  11  26  47  74
           \   \   \   \         /   /   /   /
           62  38  20   8---9--10  25  46  73
             \   \   \             /   /   /
             63  39  21--22--23--24  45  72
               \   \                 /   /
               64  40--41--42--43--44  71
                 \                     /
                 65--66--67--68--69--70
(End)
If Y is a 4-subset of an n-set X then, for n >= 5, a(n-5) is the number of (n-4)-subsets of X having exactly two elements in common with Y. - Milan Janjic, Dec 28 2007
a(n) is the maximal number of points of intersection of n+1 distinct triangles drawn in the plane. For example, two triangles can intersect in at most a(1) = 6 points (as illustrated in the Star of David configuration). - Terry Stickels (Terrystickels(AT)aol.com), Jul 12 2008
Also sequence found by reading the line from 0, in the direction 0, 6, ... and the same line from 0, in the direction 0, 18, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. Axis perpendicular to A195143 in the same spiral. - Omar E. Pol, Sep 18 2011
Partial sums of A008588. - R. J. Mathar, Aug 28 2014
Also the number of 5-cycles in the (n+5)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jul 27 2017
a(n-4) is the maximum irregularity over all maximal 3-degenerate graphs with n vertices.  The extremal graphs are 3-stars (K_3 joined to n-3 independent vertices).  (The irregularity of a graph is the sum of the differences between the degrees over all edges of the graph.) - Allan Bickle, May 29 2023

Ivan Panchenko, Table of n, a(n) for n = 0..1000
Allan Bickle and Zhongyuan Che, Irregularities of Maximal k-degenerate Graphs, Discrete Applied Math. 331 (2023) 70-87.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets.
Enrique Navarrete and Daniel Orellana, Finding Prime Numbers as Fixed Points of Sequences, arXiv:1907.10023 [math.NT], 2019.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.
Leo Tavares, Illustration: Centroid Hexagons.
Eric Weisstein's World of Mathematics, Graph Cycle.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A000567, A003215, A008588, A024966, A028895, A033996, A046092, A049598, A084939, A084940, A084941, A084942, A084943, A084944, A124080.
Cf. A002378 (3-cycles in triangular honeycomb acute knight graph), A045943 (4-cycles), A152773 (6-cycles).
Cf. A007531.
The partial sums give A007531. - Leo Tavares, Jan 22 2022
Cf. A002378, A046092, A028896 (irregularities of maximal k-degenerate graphs).

List([0..44],n->3*n*(n+1)); # Muniru A Asiru, Mar 15 2019

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

[seq(6*binomial(n,2),n=1..44)]; # Zerinvary Lajos, Nov 24 2006

6 Accumulate[Range[0, 50]] (* Harvey P. Dale, Mar 05 2012 *)
6 PolygonalNumber[Range[0, 20]] (* Eric W. Weisstein, Jul 27 2017 *)
LinearRecurrence[{3, -3, 1}, {0, 6, 18}, 20] (* Eric W. Weisstein, Jul 27 2017 *)

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

first(n) = Vec(6*x/(1 - x)^3 + O(x^n), -n) \\ Iain Fox, Feb 14 2018

def A028896(n): return 3*n*(n+1) # Chai Wah Wu, Aug 07 2025

O.g.f.: 6*x/(1 - x)^3.
E.g.f.: 3*x*(x + 2)*exp(x). - G. C. Greubel, Aug 19 2017
a(n) = 6*A000217(n).
a(n) = polygorial(3, n+1). - Daniel Dockery (peritus(AT)gmail.com), Jun 16 2003
From Zerinvary Lajos, Mar 06 2007: (Start)
a(n) = A049598(n)/2.
a(n) = A124080(n) - A046092(n).
a(n) = A033996(n) - A002378(n). (End)
a(n) = A002378(n)*3 = A045943(n)*2. - Omar E. Pol, Dec 12 2008
a(n) = a(n-1) + 6*n for n>0, a(0)=0. - Vincenzo Librandi, Aug 05 2010
a(n) = A003215(n) - 1. - Omar E. Pol, Oct 03 2011
From Philippe Deléham, Mar 26 2013: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2, a(0)=0, a(1)=6, a(2)=18.
a(n) = A174709(6*n + 5). (End)
a(n) = A049450(n) + 4*n. - Lear Young, Apr 24 2014
a(n) = Sum_{i = n..2*n} 2*i. - Bruno Berselli, Feb 14 2018
a(n) = A320047(1, n, 1). - Kolosov Petro, Oct 04 2018
a(n) = T(3*n) - T(2*n-2) + T(n-2), where T(n) = A000217(n). In general, T(k)*T(n) = Sum_{i=0..k-1} (-1)^i*T((k-i)*(n-i)). - Charlie Marion, Dec 04 2020
From Amiram Eldar, Feb 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/3.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/3 - 1/3. (End)
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(3/Pi)*cos(sqrt(7/3)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (3/Pi)*cosh(Pi/(2*sqrt(3))). (End)

A195825 Square array T(n,k) read by antidiagonals, n>=0, k>=1, which arises from a generalization of Euler's Pentagonal Number Theorem.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 5, 2, 1, 1, 1, 7, 3, 1, 1, 1, 1, 11, 4, 2, 1, 1, 1, 1, 15, 5, 3, 1, 1, 1, 1, 1, 22, 7, 4, 2, 1, 1, 1, 1, 1, 30, 10, 4, 3, 1, 1, 1, 1, 1, 1, 42, 13, 5, 4, 2, 1, 1, 1, 1, 1, 1, 56, 16, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 77, 21, 10, 4

Offset: 0

Omar E. Pol, Sep 24 2011

In the infinite square array the column k is related to the generalized m-gonal numbers, where m = k+4. For example: the first column is related to the generalized pentagonal numbers A001318. The second column is related to the generalized hexagonal numbers A000217 (note that A000217 is also the entry for the triangular numbers). And so on ... (see the program in which A195152 is a table of generalized m-gonal numbers).
In the following table Euler's Pentagonal Number Theorem is represented by the entries A001318, A195310, A175003 and A000041 (see below the first row of the table):
========================================================
.                                          Column k of
.                                          this square
.       Generalized   Triangle  Triangle   array A195825
k    m    m-gonal       "A"       "B"      [row sums of
.         numbers                          triangle "B"
.                                          with a(0)=1]
========================================================
1    5    A001318     A195310   A175003      A000041
2    6    A000217     A195826   A195836      A006950
3    7    A085787     A195827   A195837      A036820
4    8    A001082     A195828   A195838      A195848
5    9    A118277     A195829   A195839      A195849
6   10    A074377     A195830   A195840      A195850
7   11    A195160     A195831   A195841      A195851
8   12    A195162     A195832   A195842      A195852
9   13    A195313     A195833   A195843      A196933
10  14    A195818     A210944   A210954      A210964
...
It appears that column 2 of the square array is A006950.
It appears that column 3 of the square array is A036820.
Conjecture: if k is odd then column k contains (k+1)/2 plateaus whose levels are the first (k+1)/2 terms of A210843 and whose lengths are k+1, k-1, k-3, k-5, ... 2. Otherwise, if k is even then column k contains k/2 plateaus whose levels are the first k/2 terms of A210843 and whose lengths are k+1, k-1, k-3, k-5, ... 3. The sequence A210843 gives the levels of the plateaus of column k, when k -> infinity. For the visualization of the plateaus see the graph of a column, for example see the graph of A210964. - Omar E. Pol, Jun 21 2012

			Array begins:
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
    2,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
    3,  2,  1,  1,  1,  1,  1,  1,  1,  1, ...
    5,  3,  2,  1,  1,  1,  1,  1,  1,  1, ...
    7,  4,  3,  2,  1,  1,  1,  1,  1,  1, ...
   11,  5,  4,  3,  2,  1,  1,  1,  1,  1, ...
   15,  7,  4,  4,  3,  2,  1,  1,  1,  1, ...
   22, 10,  5,  4,  4,  3,  2,  1,  1,  1, ...
   30, 13,  7,  4,  4,  4,  3,  2,  1,  1, ...
   42, 16, 10,  5,  4,  4,  4,  3,  2,  1, ...
   56, 21, 12,  7,  4,  4,  4,  4,  3,  2, ...
   77, 28, 14, 10,  5,  4,  4,  4,  4,  3, ...
  101, 35, 16, 12,  7,  4,  4,  4,  4,  4, ...
  135, 43, 21, 13, 10,  5,  4,  4,  4,  4, ...
  176, 55, 27, 14, 12,  7,  4,  4,  4,  4, ...
  ...
Column 1 is A000041 which starts: [1, 1], 2, 3, 5, 7, 11, ... The column contains only one plateau: [1, 1] which has level 1 and length 2.
Column 3 is A036820 which starts: [1, 1, 1, 1], 2, 3, [4, 4], 5, 7, 10, ... The column contains two plateaus: [1, 1, 1, 1], [4, 4], which have levels 1, 4 and lengths 4, 2.
Column 6 is A195850 which starts: [1, 1, 1, 1, 1, 1, 1], 2, 3, [4, 4, 4, 4, 4], 5, 7, 10, 12, [13, 13, 13], 14, 16, 21, ... The column contains three plateaus: [1, 1, 1, 1, 1, 1, 1], [4, 4, 4, 4, 4], [13, 13, 13], which have levels 1, 4, 13 and lengths 7, 5, 3.

Leonhard Euler, De mirabilibus proprietatibus numerorum pentagonalium
Leonhard Euler, On the remarkable properties of the pentagonal numbers, arXiv:math/0505373 [math.HO], 2005.
Eric Weisstein's World of Mathematics, Pentagonal Number Theorem
Wikipedia, Pentagonal number theorem

Columns (1-10): A000041, A006950, A036820, A195848, A195849, A195850, A195851, A195852, A196933, A210964.
For another version see A211970.
Cf. A057077, A195152, A210843.

Column k is asymptotic to exp(Pi*sqrt(2*n/(k+2))) / (8*sin(Pi/(k+2))*n). - Vaclav Kotesovec, Aug 14 2017

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

Original entry on oeis.org

0, 1, 4, 8, 14, 21, 30, 40, 52, 65, 80, 96, 114, 133, 154, 176, 200, 225, 252, 280, 310, 341, 374, 408, 444, 481, 520, 560, 602, 645, 690, 736, 784, 833, 884, 936, 990, 1045, 1102, 1160, 1220, 1281, 1344, 1408, 1474, 1541, 1610, 1680, 1752, 1825, 1900, 1976, 2054

Offset: 0

N. J. A. Sloane

Equals (1, 2, 3, 4, ...) convolved with (1, 2, 1, 2, ...). a(4) = 14 = (1, 2, 3, 4) dot (2, 1, 2, 1) = (2 + 2 + 6 + 4). - Gary W. Adamson, May 01 2009
We observe that is the transform of A032766 by the following transform T: T(u_0,u_1,u_2,u_3,...) = (u_0, u_0+u_1, u_0+u_1+u_2, u_0+u_1+u_2+u_3+u_4,...). In other words, v_p = Sum_{k=0..p} u_k and the g.f. phi_v of is given by phi_v = phi_u/(1-z). - Richard Choulet, Jan 28 2010
Equals row sums of a triangle with (1, 4, 7, 10, ...) in every column, shifted down twice for columns > 1. - Gary W. Adamson, Mar 03 2010
Number of pairs (x,y) with x in {0,...,n}, y odd in {0,...,2n}, and x < y. - Clark Kimberling, Jul 02 2012
Also A049451 and positives A000567 interleaved. - Omar E. Pol, Aug 03 2012
Similar to A001082. Members of this family are A093005, A210977, this sequence, A210978, A181995, A210981, A210982. - Omar E. Pol, Aug 09 2012

			G.f. = x + 4*x^2 + 8*x^3 + 14*x^4 + 21*x^5 + 30*x^6 + 40*x^7 + 52*x^8 + 65*x^9 + ...

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

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Bruno Berselli, Hexagonal spiral containing the initial terms.
Marc Le Brun, Email to N. J. A. Sloane, Jul 1991
Emanuele Munarini, Topological indices for the antiregular graphs, Le Mathematiche (2021) Vol. 76, No. 1, see p. 283.
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.
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Cf. A001859, A077043, A002620, A002378.
Row sums of A104567.
Cf. A000034, A032766, A002717, A070893. - Richard Choulet, Jan 28 2010
Cf. A051125.

[(6*n^2+4*n-1+(-1)^n)/8: n in [0..50] ]; // Vincenzo Librandi, Aug 20 2011

with (combinat): seq(count(Partition((3*n+1)), size=3), n=0..52); # Zerinvary Lajos, Mar 28 2008
# 2nd program
A006578 := proc(n)
    (6*n^2 + 4*n - 1 + (-1)^n)/8 ;
end proc: # R. J. Mathar, Apr 28 2017

Accumulate[LinearRecurrence[{1,1,-1}, {0,1,3}, 100]] (* Harvey P. Dale, Sep 29 2013 *)
a[ n_] := Quotient[n + 1, 2] (Quotient[n, 2] 3 + 1); (* Michael Somos, Jun 09 2014 *)
a[ n_] := Quotient[3 (n + 1)^2 + 1, 4] - (n + 1); (* Michael Somos, Jun 10 2015 *)
LinearRecurrence[{2, 0, -2, 1},{0, 1, 4, 8},53] (* Ray Chandler, Aug 03 2015 *)

{a(n) = (3*(n+1)^2 + 1)\4 - n - 1}; /* Michael Somos, Mar 10 2006 */

Expansion of x*(1+2*x) / ((1-x)^2*(1-x^2)). - Simon Plouffe in his 1992 dissertation
a(n) + A002620(n) = A002378(n) = n*(n+1).
Partial sums of A032766. - Paul Barry, May 30 2003
a(n) = a(n-1) + a(n-2) - a(n-3) + 3 = A002620(n) + A004526(n) = A001859(n) - A004526(n+1). - Henry Bottomley, Mar 08 2000
a(n) = (6*n^2 + 4*n - 1 + (-1)^n)/8. - Paul Barry, May 30 2003
a(n) = A001859(-1-n) for all n in Z. - Michael Somos, May 10 2006
a(n) = (A002378(n)/2 + A035608(n))/2. - Reinhard Zumkeller, Feb 07 2010
a(n) = (3*n^2 + 2*n - (n mod 2))/4. - Ctibor O. Zizka, Mar 11 2012
a(n) = Sum_{i=1..n} floor(3*i/2) = Sum_{i=0..n} (i + floor(i/2)). - Enrique Pérez Herrero, Apr 21 2012
a(n) = 3*n*(n+1)/2 - A001859(n). - Clark Kimberling, Jul 02 2012
a(n) = Sum_{i=1..n} (n - i + 1) * 2^( (i+1) mod 2 ). - Wesley Ivan Hurt, Mar 30 2014
a(n) = A002717(n) - A002717(n-1). - Michael Somos, Jun 09 2014
a(n) = Sum_{k=1..n} floor((n+k+1)/2). - Wesley Ivan Hurt, Mar 31 2017
a(n) = A002620(n+1)+2*A002620(n). - R. J. Mathar, Apr 28 2017
Sum_{n>=1} 1/a(n) = 3 - Pi/(4*sqrt(3)) - 3*log(3)/4. - Amiram Eldar, May 28 2022
E.g.f.: (x*(5 + 3*x)*cosh(x) - (1 - 5*x - 3*x^2)*sinh(x))/4. - Stefano Spezia, Aug 22 2023

Offset and description changed by N. J. A. Sloane, Nov 30 2006

A218864 Numbers of the form 9k^2 + 8k, k an integer.

Original entry on oeis.org

0, 1, 17, 20, 52, 57, 105, 112, 176, 185, 265, 276, 372, 385, 497, 512, 640, 657, 801, 820, 980, 1001, 1177, 1200, 1392, 1417, 1625, 1652, 1876, 1905, 2145, 2176, 2432, 2465, 2737, 2772, 3060, 3097, 3401, 3440, 3760, 3801, 4137, 4180, 4532, 4577, 4945, 4992

Offset: 1

Jason Kimberley, Nov 08 2012

Numbers m such that 9*m + 16 is a square. - Vincenzo Librandi, Apr 07 2013
Equivalently, integers of the form h*(h + 8)/9 (nonnegative values of h are listed in A090570). - Bruno Berselli, Jul 15 2016
Generalized 20-gonal (or icosagonal) numbers: r*(9*r - 8) with r = 0, +1, -1, +2, -2, +3, -3, ... - Omar E. Pol, Jun 06 2018
Partial sums of A317316. - Omar E. Pol, Jul 28 2018
Exponents in expansion of Product_{n >= 1} (1 + x^(18*n-17))*(1 + x^(18*n-1))*(1 - x^(18*n)) = 1 + x + x^17 + x^20 + x^52 + .... - Peter Bala, Dec 10 2020

Jason Kimberley, Table of n, a(n) for n = 1..2000
S. Cooper and M. D. Hirschhorn, Results of Hurwitz type for three squares. Discrete Math., Vol. 274, No. 1-3 (2004), pp. 9-24. See C(q).
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Characteristic function is A205987.
Numbers of the form 9*m^2+k*m, for integer n: A016766 (k=0), A132355 (k=2), A185039 (k=4), A057780 (k=6), this sequence (k=8).
Cf. A074377 (numbers m such that 16*m+9 is a square).
Cf. A317316.
For similar sequences of numbers m such that 9*m+i is a square, see list in A266956.
Cf. sequences of the form m*(m+i)/(i+1) listed in A274978. [Bruno Berselli, Jul 25 2016]
Sequences of generalized k-gonal numbers: A001318 (k=5), A000217 (k=6), A085787 (k=7), A001082 (k=8), A118277 (k=9), A074377 (k=10), A195160 (k=11), A195162 (k=12), A195313 (k=13), A195818 (k=14), A277082 (k=15), A274978 (k=16), A303305 (k=17), A274979 (k=18), A303813 (k=19), this sequence (k=20), A303298 (k=21), A303299 (k=22), A303303 (k=23), A303814 (k=24), A303304 (k=25), A316724 (k=26), A316725 (k=27), A303812 (k=28), A303815 (k=29), A316729 (k=30).

a:=func; [0]cat[a(n*m): m in [-1,1], n in [1..20]];

Array[(18 # (# - 1) - 7 (-1)^#*(2 # - 1) - 7)/8 &, 48] (* or *)
CoefficientList[Series[x (1 + 16 x + x^2)/((1 + x)^2*(1 - x)^3), {x, 0, 47}], x] (* Michael De Vlieger, Jun 06 2018 *)

a(n) = (18*n*(n - 1) - 7*(-1)^n*(2*n - 1) - 7)/8. - Bruno Berselli, Nov 13 2012
G.f.: x*(1 + 16*x + x^2)/((1 + x)^2*(1 - x)^3). - Bruno Berselli, Nov 14 2012
Sum_{n>=2} 1/a(n) = (9 + 8*Pi*cot(Pi/9))/64. - Amiram Eldar, Feb 28 2022

A274979 Integers of the form m*(m + 7)/8.

Original entry on oeis.org

0, 1, 15, 18, 46, 51, 93, 100, 156, 165, 235, 246, 330, 343, 441, 456, 568, 585, 711, 730, 870, 891, 1045, 1068, 1236, 1261, 1443, 1470, 1666, 1695, 1905, 1936, 2160, 2193, 2431, 2466, 2718, 2755, 3021, 3060, 3340, 3381, 3675, 3718, 4026, 4071, 4393, 4440, 4776, 4825

Offset: 1

Bruno Berselli, Jul 15 2016

Nonnegative values of m are listed in A047393.
Also, numbers h such that 32*h + 49 is a square.
Equivalently, numbers of the form i*(8*i + 7) with i = 0, -1, 1, -2, 2, -3, 3, ...
Infinitely many squares belong to this sequence.
The first bisection is A139278, and 0 followed by the second bisection gives A051870.
Generalized 18-gonal (or octadecagonal) numbers (see the third comment). - Omar E. Pol, Jun 06 2018
Partial sums of A317314. - Omar E. Pol, Jul 28 2018
Exponents in expansion of Product_{n >= 1} (1 + x^(16*n-15))*(1 + x^(16*n-1))*(1 - x^(16*n)) = 1 + x + x^15 + x^18 + x^46 + .... - Peter Bala, Dec 10 2020
Generalized k-gonal numbers are second k-gonal numbers and positive terms of k-gonal numbers interleaved, k >= 5. They are also the partial sums of the sequence formed by the multiples of (k - 4) and the odd numbers (A005408) interleaved, k >= 5. In this case k = 18. - Omar E. Pol, Apr 25 2021

			100 is in the sequence because 100 = 25*(25+7)/8 or also 100 = 4*(8*4-7).
From _Omar E. Pol_, Apr 24 2021: (Start)
Illustration of initial terms as vertices of a rectangular spiral:
        46_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _18
         |                                                       |
         |                           0                           |
         |                           |_ _ _ _ _ _ _ _ _ _ _ _ _ _|
         |                           1                           15
         |
        51
More generally, all generalized k-gonal numbers can be represented with this kind of spirals, k >= 5. In this case  k = 18. (End)

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

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

[t: m in [0..200] | IsIntegral(t) where t is m*(m+7)/8];

Select[m = Range[0, 200]; m (m + 7)/8, IntegerQ] (* Jean-François Alcover, Jul 21 2016 *)
Select[Table[(m(m+7))/8,{m,0,200}],IntegerQ] (* or *) LinearRecurrence[ {1,2,-2,-1,1},{0,1,15,18,46},50] (* Harvey P. Dale, May 07 2019 *)

def A274979(n): return (n>>1)*((n<<2)+(3 if n&1 else -7)) # Chai Wah Wu, Mar 11 2025

def A274979_list(len):
    h = lambda m: m*(m+7)/8
    return [h(m) for m in (0..len) if h(m) in ZZ]
print(A274979_list(199)) # Peter Luschny, Jul 18 2016

O.g.f.: x^2*(1 + 14*x + x^2)/((1 + x)^2*(1 - x)^3).
E.g.f.: (3*(2*x + 1)*exp(-x) + (8*x^2 - 3)*exp(x))/4.
a(n) = (8*(n-1)*n - 3*(2*n-1)*(-1)^n - 3)/4.
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5) for n >= 6. - Wesley Ivan Hurt, Dec 18 2020
From Amiram Eldar, Feb 28 2022: (Start)
Sum_{n>=2} 1/a(n) = (8 + 7*(sqrt(2)+1)*Pi)/49.
Sum_{n>=2} (-1)^n/a(n) = 8*log(2)/7 + 2*sqrt(2)*log(sqrt(2)+1)/7 - 8/49. (End)
a(n) = (n-1)*(4*n+3)/2 if n is odd and a(n) = n*(4*n-7)/2 if n is even. - Chai Wah Wu, Mar 11 2025

A274978 Integers of the form m*(m + 6)/7.

Original entry on oeis.org

0, 1, 13, 16, 40, 45, 81, 88, 136, 145, 205, 216, 288, 301, 385, 400, 496, 513, 621, 640, 760, 781, 913, 936, 1080, 1105, 1261, 1288, 1456, 1485, 1665, 1696, 1888, 1921, 2125, 2160, 2376, 2413, 2641, 2680, 2920, 2961, 3213, 3256, 3520, 3565, 3841, 3888, 4176, 4225, 4525, 4576

Offset: 1

Bruno Berselli, Jul 15 2016

Nonnegative values of m are listed in A047274.
Also, numbers h such that 7*h + 9 is a square.
Equivalently, numbers of the form i*(7*i - 6) with i = 0, 1, -1, 2, -2, 3, -3, ...
Infinitely many squares belong to this sequence.
Generalized 16-gonal (or hexadecagonal) numbers. See the third comment. - Omar E. Pol, Jun 06 2018
Partial sums of A317312. - Omar E. Pol, Jul 28 2018
Exponents in expansion of Product_{n >= 1} (1 + x^(14*n-13))*(1 + x^(14*n-1))*(1 - x^(14*n)) = 1 + x + x^13 + x^16+ x^40 + .... - Peter Bala, Dec 10 2020

			88 is in the sequence because 88 = 22*(22+6)/7 or also 88 = 4*(7*4-6).

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

Supersequence of A051868.
Cf. A317312.
Cf. sequences of the form m*(m+k)/(k+1): A000290 (k=0), A000217 (k=1), A001082 (k=2), A074377 (k=3), A195162 (k=4), A144065 (k=5), A274978 (k=6), A274979 (k=7), A218864 (k=8).
Sequences of generalized k-gonal numbers: A001318 (k=5), A000217 (k=6), A085787 (k=7), A001082 (k=8), A118277 (k=9), A074377 (k=10), A195160 (k=11), A195162 (k=12), A195313 (k=13), A195818 (k=14), A277082 (k=15), this sequence (k=16), A303305 (k=17), A274979 (k=18), A303813 (k=19), A218864 (k=20), A303298 (k=21), A303299 (k=22), A303303 (k=23), A303814 (k=24), A303304 (k=25), A316724 (k=26), A316725 (k=27), A303812 (k=28), A303815 (k=29), A316729 (k=30).

[t: m in [0..200] | IsIntegral(t) where t is m*(m+6)/7];

Select[m = Range[0, 200]; m (m + 6)/7, IntegerQ] (* Jean-François Alcover, Jul 21 2016 *)
Select[Table[(n(n+6))/7,{n,0,200}],IntegerQ] (* Harvey P. Dale, Sep 20 2022 *)

def A274978_list(len):
    h = lambda m: m*(m+6)/7
    return [h(m) for m in (0..len) if h(m) in ZZ]
print(A274978_list(179)) # Peter Luschny, Jul 18 2016

O.g.f.: x^2*(1 + 12*x + x^2)/((1 + x)^2*(1 - x)^3).
E.g.f.: (5*(2*x + 1)*exp(-x) + (14*x^2 - 5)*exp(x))/8.
a(n) = (14*(n-1)*n - 5*(2*n-1)*(-1)^n - 5)/8.
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5) for n >= 6. - Wesley Ivan Hurt, Dec 18 2020
Sum_{n>=2} 1/a(n) = (7 + 6*Pi*cot(Pi/7))/36. - Amiram Eldar, Feb 28 2022

A136047 a(1)=1, a(n)=a(n-1)+n if n even, a(n)=a(n-1)+n^2 if n is odd.

Original entry on oeis.org

1, 3, 12, 16, 41, 47, 96, 104, 185, 195, 316, 328, 497, 511, 736, 752, 1041, 1059, 1420, 1440, 1881, 1903, 2432, 2456, 3081, 3107, 3836, 3864, 4705, 4735, 5696, 5728, 6817, 6851, 8076, 8112, 9481, 9519, 11040, 11080, 12761, 12803, 14652, 14696, 16721

Offset: 1

Zak Seidov, Dec 12 2007

The only prime terms are 3, 41, 47.
The semiprime terms are A136048.
Cf. A001082/A135370: f(1) = 1, then if n even/odd f(n) = n+f(n-1), if n odd/even f(n) = 2*n+f(n-1).

Index entries for linear recurrences with constant coefficients, signature (1,3,-3,-3,3,1,-1).

Cf. A001082, A135370, A136048.

a[1]=1;a[n_]:=a[n]=a[n-1]+n^(1+Mod[n,2]); Table[a[n],{n,100}]
nxt[{n_,a_}]:={n+1,If[OddQ[n],a+n+1,a+(n+1)^2]}; Transpose[NestList[nxt,{1,1},50]][[2]] (* Harvey P. Dale, Oct 11 2015 *)

a(n) = (1/12)(1 + n)(2n^2+7n-3) if n is odd, a(n)=(1/12)n(2n^2+3n+4) if n is even.
a(n) = (-3 + 3*(-1)^n + 8*n + 12*n^2 - 6*(-1)^n*n^2 + 4*n^3)/24.
a(1)=1 then a(n) = a(n-1)+n^(if n is even then 1 else 2),
         or a(n) = a(n-1)+n^(1+mod(n,2)),
         or a(n) = a(n-1)+n^((3-(-1)^n)/2).
From R. J. Mathar, Feb 22 2009: (Start)
a(n) = a(n-1)+3*a(n-2)-3*a(n-3)-3*a(n-4)+3*a(n-5)+a(n-6)-a(n-7).
G.f.: x*(1+2*x+6*x^2-2*x^3+x^4)/((1+x)^3*(x-1)^4). (End)

Edited by Michel Marcus, Mar 02 2022

cp's OEIS Frontend

A195818 Generalized 14-gonal numbers: m*(6*m-5), m = 0,+1,-1,+2,-2,+3,-3,...

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

Formula

A054000 a(n) = 2*n^2 - 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A087475 a(n) = n^2 + 4.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Scala

Formula

A028896 6 times triangular numbers: a(n) = 3*n*(n+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Python

Formula

A195825 Square array T(n,k) read by antidiagonals, n>=0, k>=1, which arises from a generalization of Euler's Pentagonal Number Theorem.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

A195818 Generalized 14-gonal numbers: m(6m-5), m = 0,+1,-1,+2,-2,+3,-3,...

A028896 6 times triangular numbers: a(n) = 3n(n+1).

A218864 Numbers of the form 9k^2 + 8k, k an integer.