A001318 -id:A001318 - cp's OEIS frontend

A032528 Concentric hexagonal numbers: floor(3*n^2/2).

0, 1, 6, 13, 24, 37, 54, 73, 96, 121, 150, 181, 216, 253, 294, 337, 384, 433, 486, 541, 600, 661, 726, 793, 864, 937, 1014, 1093, 1176, 1261, 1350, 1441, 1536, 1633, 1734, 1837, 1944, 2053, 2166, 2281, 2400, 2521, 2646, 2773, 2904, 3037, 3174, 3313, 3456, 3601, 3750

Offset: 0

N. J. A. Sloane

From Omar E. Pol, Aug 20 2011: (Start)
Cellular automaton on the hexagonal net. The sequence gives the number of "ON" cells in the structure after n-th stage. A007310 gives the first differences. For a definition without words see the illustration of initial terms in the example section. Note that the cells become intermittent. A083577 gives the primes of this sequences.
A033581 and A003154 interleaved.
Row sums of an infinite square array T(n,k) in which column k lists 2*k-1 zeros followed by the numbers A008458 (see example).  (End)
Sequence found by reading the line from 0, in the direction 0, 1, ... and the same line from 0, in the direction 0, 6, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. Main axis perpendicular to A045943 in the same spiral. - Omar E. Pol, Sep 08 2011

			From _Omar E. Pol_, Aug 20 2011: (Start)
Using the numbers A008458 we can write:
  0, 1, 6, 12, 18, 24, 30, 36, 42,  48,  54, ...
  0, 0, 0,  1,  6, 12, 18, 24, 30,  36,  42, ...
  0, 0, 0,  0,  0,  1,  6, 12, 18,  24,  30, ...
  0, 0, 0,  0,  0,  0,  0,  1,  6,  12,  18, ...
  0, 0, 0,  0,  0,  0,  0,  0,  0,   1,   6, ...
And so on.
===========================================
The sums of the columns give this sequence:
0, 1, 6, 13, 24, 37, 54, 73, 96, 121, 150, ...
...
Illustration of initial terms as concentric hexagons:
.
.                                         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
.
. 1    6        13           24               37
.
(End)

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

Cf. A003154, A007310, A008458, A033581, A083577, A000326, A001318, A005449, A045943, A032527, A195041. Column 6 of A195040.
Cf. A004524, A004525, A033436, A212959, A238410, A227017, A282513.
Cf. A033581, A003154, A011934, A184533.

a032528 n = a032528_list !! n
a032528_list = scanl (+) 0 a007310_list
-- Reinhard Zumkeller, Jan 07 2012

[Floor(3*n^2/2): n in [0..50]]; // Vincenzo Librandi, Aug 21 2011

f[n_, m_] := Sum[Floor[n^2/k], {k, 1, m}]; t = Table[f[n, 2], {n, 1, 90}] (* Clark Kimberling, Apr 20 2012 *)

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

From Joerg Arndt, Aug 22 2011: (Start)
G.f.: (x+4*x^2+x^3)/(1-2*x+2*x^3-x^4) = x*(1+4*x+x^2)/((1+x)*(1-x)^3).
a(n) = +2*a(n-1) -2*a(n-3) +1*a(n-4). (End)
a(n) = (6*n^2+(-1)^n-1)/4. - Bruno Berselli, Aug 22 2011
a(n) = A184533(n), n >= 2. - Clark Kimberling, Apr 20 2012
First differences of A011934: a(n) = A011934(n) - A011934(n-1) for n>0. - Franz Vrabec, Feb 17 2013
From Paul Curtz, Mar 31 2019: (Start)
a(-n) = a(n).
a(n) = a(n-2) + 6*(n-1) for n > 1.
a(2*n) = A033581(n).
a(2*n+1) = A003154(n+1). (End)
E.g.f.: (3*x*(x + 1)*cosh(x) + (3*x^2 + 3*x - 1)*sinh(x))/2. - Stefano Spezia, Aug 19 2022
Sum_{n>=1} 1/a(n) = Pi^2/36 + tan(Pi/(2*sqrt(3)))*Pi/(2*sqrt(3)). - Amiram Eldar, Jan 16 2023

New name and more terms a(41)-a(50) from Omar E. Pol, Aug 20 2011

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

Original entry on oeis.org

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

A022567 Expansion of Product_{m>=1} (1+x^m)^2.

Original entry on oeis.org

1, 2, 3, 6, 9, 14, 22, 32, 46, 66, 93, 128, 176, 238, 319, 426, 562, 736, 960, 1242, 1598, 2048, 2608, 3306, 4175, 5248, 6570, 8198, 10190, 12622, 15589, 19190, 23552, 28830, 35190, 42842, 52034, 63040, 76198, 91904, 110604, 132832, 159216, 190464, 227417

Offset: 0

N. J. A. Sloane, Jun 14 1998

nonn

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number of partitions of n into distinct parts, with 2 types of each part. E.g., for n=4, we consider k and k* to be different versions of k and so we have 4, 4*, 31, 31*, 3*1, 3*1*, 22*, 211*, 2*11*, thus a(4)=9. - Jon Perry, Apr 04 2004
Number of partitions of n into odd parts, each part being of two kinds. E.g., a(3)=6 because we have 3, 3', 1+1+1, 1+1+1', 1+1'+1', 1'+1'+1'. - Emeric Deutsch, Mar 22 2005
Euler transform of period 2 sequence [2,0,2,0,...]. - Emeric Deutsch, Mar 22 2005
Equals A000041 convolved with A010054. - Gary W. Adamson, Jun 11 2009
The sum of the least gaps in all partitions of n. The "least gap" of a partition is the least positive integer that is not a part of the partition. Example: a(4) = 9 because the least gaps in [4], [3,1], [2,2], [2,1,1], and [1,1,1,1] are 1, 2, 1, 3, and 2, respectively. - Emeric Deutsch, May 18 2015
Number of 2-regular bipartitions of n. - N. J. A. Sloane, Oct 20 2019
The least gap is also known as the minimal excludant or mex; see Andrews and Newman. - George Beck, Dec 10 2020

			G.f. = 1 + 2*x + 3*x^2 + 6*x^3 + 9*x^4 + 14*x^5 + 22*x^6 + 32*x^7 + 46*x^8 + ...
G.f. = q + 2*q^13 + 3*q^25 + 6*q^37 + 9*q^49 + 14*q^61 + 22*q^73 + 32*q^85 + ...

P. J. Grabner, A. Knopfmacher, Analysis of some new partition statistics, Ramanujan J., 12, 2006, 439-454.
Kathiravan, T., and S. N. Fathima. "On L-regular bipartitions modulo L." The Ramanujan Journal 44.3 (2017): 549-558.

Alois P. Heinz, Table of n, a(n) for n = 0..10000
George E. Andrews, David Newman, Partitions and the Minimal Excludant, Annals of Combinatorics, Volume 23, May 2019, Pages 249-254.
Cristina Ballantine, Mircea Merca, Bisected theta series, least r-gaps in partitions, and polygonal numbers, arXiv:1710.05960 [math.CO], 2017.
Helena Bergold, Lukas Egeling, and Hung. P. Hoang, Signotopes with few plus signs, arXiv:2411.19208 [math.CO], 2024. See p. 14.
J. Currie, N. Rampersad, Binary words avoiding xx^Rx and strongly unimodal sequences, JIS 18 (2015) #15.10.3.
Alejandro Erickson, Frank Ruskey, Enumerating maximal tatami mat coverings of square grids with v vertical dominoes, arXiv:1304.0070 [math.CO], 2013.
Alejandro Erickson and Mark Schurch, Monomer-dimer tatami tilings of square regions, arXiv preprint arXiv:1110.5103 [math.CO], 2011.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 852
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 8.
Mircea Merca, A new look on the generating function for the number of divisors, Journal of Number Theory, Volume 149, April 2015, Pages 57-69.
Mircea Merca, Combinatorial interpretations of a recent convolution for the number of divisors of a positive integer, Journal of Number Theory, Volume 160, March 2016, Pages 60-75. See q(n)'.
Mbavhalelo Mulokwe and Konstantinos Zoubos, Free fermions, neutrality and modular transformations, arXiv:2403.08531 [hep-th], 2024.
Michael Somos, Introduction to Ramanujan theta functions
Jacob Sprittulla, On Colored Factorizations, arXiv:2008.09984 [math.CO], 2020.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A000009, A022597, A285221, A304048.
Cf. A010054. - Gary W. Adamson, Jun 11 2009
Column k=2 of A286335.
Number of r-regular bipartitions of n for r = 2,3,4,5,6: A022567, A328547, A001936, A263002, A328548.

Coefficients(&*[(1+x^m)^2:m in [1..40]])[1..40] where x is PolynomialRing(Integers()).1; // G. C. Greubel, Feb 26 2018

A022567 := proc(n)
    local x,m;
    product((1+x^m)^2,m=1..n) ;
    expand(%) ;
    coeff(%,x,n) ;
end proc: # R. J. Mathar, Jun 18 2016

a[ n_] := SeriesCoefficient[ QPochhammer[ q, q^2]^-2, {q, 0, n}]; (* Michael Somos, Jul 11 2011 *)
a[ n_] := SeriesCoefficient[ Product[ 1 + q^k, {k, n}]^2, {q, 0, n}]; (* Michael Somos, Jul 11 2011 *)
(QPochhammer[-1, x]^2/4 + O[x]^30)[[3]] (* Vladimir Reshetnikov, Sep 22 2016 *)
nmax = 50; poly = ConstantArray[0, nmax+1]; poly[[1]] = 1; poly[[2]] = 2; poly[[3]] = 1; Do[Do[Do[poly[[j+1]] += poly[[j-k+1]], {j, nmax, k, -1}]; , {p, 1, 2}], {k, 2, nmax}]; poly (* Vaclav Kotesovec, Jan 14 2017 *)

{a(n) = if( n<0, 0, polcoeff( prod( k=1, n, 1 + x^k, 1 + x * O(x^n))^2, n))}; /* Michael Somos, Mar 21 2004 */

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x^2 + A) / eta(x + A))^2, n))}; /* Michael Somos, Jun 03 2005 */

# uses[EulerTransform from A166861]
b = BinaryRecurrenceSequence(0, 1, 0, 2)
a = EulerTransform(b)
print([a(n) for n in range(45)]) # Peter Luschny, Nov 11 2020

a(n) = p(n)+p(n-1)+p(n-3)+p(n-6)+...+p(n-k*(k+1)/2)+..., where p() is A000041(). E.g. a(8) = p(8)+p(7)+p(5)+p(2) = 22+15+7+2 = 46. - Vladeta Jovovic, Aug 09 2004
Expansion of q^(-1/12) * (eta(q^2) / eta(q))^2 in powers of q. - Michael Somos, Apr 27 2008
Expansion of chi(-q)^(-2) in powers of q where chi() is a Ramanujan theta function. - Michael Somos, Apr 27 2008
G.f. is a period 1 Fourier series which satisfies f(-1 / (288 t)) = (1/2) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A022597. - Michael Somos, Apr 27 2008
G.f.: Product_{k>0} (1 + x^k)^2.
Convolution square of A000009. Convolution inverse of A022597. - Michael Somos, Apr 27 2008
Parity result: a(n) is even except when n is twice a generalized pentagonal number (i.e., of the form 2*A001318(m) for some m). - Peter Bala, Mar 19 2009
a(n) ~ exp(Pi * sqrt(2*n/3)) / (4 * 6^(1/4) * n^(3/4)) * (1 + (Pi/(12*sqrt(6)) - 3*sqrt(3/2)/(8*Pi)) / sqrt(n) + (Pi^2/1728 - 45/(256*Pi^2) - 5/64)/n). - Vaclav Kotesovec, Mar 05 2015, extended Jan 22 2017
a(0) = 1, a(n) = (2/n)*Sum_{k=1..n} A000593(k)*a(n-k) for n > 0. - Seiichi Manyama, Apr 03 2017
G.f.: exp(2*Sum_{k>=1} (-1)^(k+1)*x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 06 2018

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

A019298 Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).

Original entry on oeis.org

0, 1, 4, 11, 23, 42, 69, 106, 154, 215, 290, 381, 489, 616, 763, 932, 1124, 1341, 1584, 1855, 2155, 2486, 2849, 3246, 3678, 4147, 4654, 5201, 5789, 6420, 7095, 7816, 8584, 9401, 10268, 11187, 12159, 13186

Offset: 0

Eric E Blom (eblom(AT)REM.re.uokhsc.edu)

Alternately add and subtract successively longer sets of integers: 0; 1 = 0+1; -4 = 1-2-3; 11 = -4+4+5+6; -23 = 11-7-8-9-10; 42 = -23+11+12+13+14+15; -69 = 42-16-17-18-19-20-21; ... then take absolute values. - Walter Carlini, Aug 28 2003
Number of 3 X 3 symmetric matrices with nonnegative integer entries, such that every row (and column) sum equals n-1.
Equals Sum_{0..n} of "three-quarter squares" sequence (A077043). - Philipp M. Buluschek (kitschen(AT)romandie.com), Aug 12 2007
a(n) is the sum of the n-th row in A220075, n > 0. - Reinhard Zumkeller, Dec 03 2012
Sum of all the smallest parts in the partitions of 3n into three parts (see example). - Wesley Ivan Hurt, Jan 23 2014
For n > 0, a(n) is the number of (nonnegative integer) magic labelings of the prism graph Y_3 with magic sum n - 1. - L. Edson Jeffery, Sep 09 2017
Or number of magic labelings of LOOP X C_3 with magic sum n - 1, where LOOP is the 1-vertex, 1-loop-edge graph, as Y_k = I X C_k and LOOP X C_k have the same numbers of magic labelings when k is odd. - David J. Seal, Sep 13 2017
a(n) is the number of triples of integers in [1,n]^3 such that each pair has sum larger than n. - Bob Zwetsloot, Jul 23 2020

			Add last column for a(n) (n > 0).
                                               13 + 1 + 1
                                               12 + 2 + 1
                                               11 + 3 + 1
                                               10 + 4 + 1
                                                9 + 5 + 1
                                                8 + 6 + 1
                                                7 + 7 + 1
                                   10 + 1 + 1  11 + 2 + 2
                                    9 + 2 + 1  10 + 3 + 2
                                    8 + 3 + 1   9 + 4 + 2
                                    7 + 4 + 1   8 + 5 + 2
                                    6 + 5 + 1   7 + 6 + 2
                        7 + 1 + 1   8 + 2 + 2   9 + 3 + 3
                        6 + 2 + 1   7 + 3 + 2   8 + 4 + 3
                        5 + 3 + 1   6 + 4 + 2   7 + 5 + 3
                        4 + 4 + 1   5 + 5 + 2   6 + 6 + 3
            4 + 1 + 1   5 + 2 + 2   6 + 3 + 3   7 + 4 + 4
            3 + 2 + 1   4 + 3 + 2   5 + 4 + 3   6 + 5 + 4
1 + 1 + 1   2 + 2 + 2   3 + 3 + 3   4 + 4 + 4   5 + 5 + 5
   3(1)        3(2)        3(3)        3(4)        3(5)     ..   3n
---------------------------------------------------------------------
    1           4           11          23          42      ..  a(n)

R. P. Stanley, Enumerative Combinatorics, Wadsworth, Vol. 1, 1986; see Prop. 4.6.21, p. 235, G_3(lambda).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 7.14(a), p. 452.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
G. E. Andrews, P. Paule and A. Riese, MacMahon's partition analysis III. The Omega package, January 1999, p. 13.
L. Carlitz, Enumeration of symmetric arrays, Duke Math. J., Vol. 33 (1966), 771-782. MR0201332 (34 #1216).
R. J. Mathar, Illustrations of magic labelings (2025)
R. P. Stanley, Magic labelings of graphs, symmetric magic squares,..., Duke Math. J. 43 (3) (1976) 511-531, Section 5, F_3(x).
R. P. Stanley, Examples of Magic Labelings, Unpublished Notes, 1973 [Cached copy, with permission]
Index entries for linear recurrences with constant coefficients, signature (3,-2,-2,3,-1).

Cf. A053493, A077043 (first differences), A002717.
Cf. A061927, A244497, A292281, A244873, A289992 (# of magic labelings of prism graph Y_k = I X C_k, for k = 4,5,6,7,8, up to an offset).
Cf. A006325, A244879, A244880 (# of magic labelings of LOOP X C_k, for k = 4,6,8, up to an offset).

[Floor((n^2+1)*(2*n+3)/8): n in [0..80]]; // Vincenzo Librandi, Jul 28 2013

Maple
```
series(x*(x^2+x+1)/(x+1)/(x-1)^4,x,80);
```

Table[ Ceiling[3*n^2/4], {n, 0, 37}] // Accumulate (* Jean-François Alcover, Dec 20 2012, after Philipp M. Buluschek's comment *)
CoefficientList[Series[x (x^2 + x + 1) / ((x + 1) (x - 1)^4), {x, 0, 40}], x] (* Vincenzo Librandi, Jul 28 2013 *)
LinearRecurrence[{3, -2, -2, 3, -1}, {0, 1, 4, 11, 23}, 38] (* L. Edson Jeffery, Sep 09 2017 *)

a(n)=(n^2+1)*(2*n+3)\8 \\ Charles R Greathouse IV, Apr 04 2013

def A019298(n): return n*(n*(2*n+3)+2)+3>>3 # Chai Wah Wu, Jun 07 2025

a(n) = floor((n^2+1)(2n+3)/8).
G.f.: x*(x^2+x+1)/((x+1)*(x-1)^4).
a(n) = floor((2n^3 + 3n^2 + 2n)/8); also nearest integer to ((n+1)^4 - n^4)/16.
a(n) = (4n^3 + 6n^2 + 4n+1 - (-1)^n)/16. - Wesley Petty (Wesley.Petty(AT)mail.tamucc.edu), Mar 06 2004
a(n) = Sum_{i=1..n} i^2 - floor(i^2/4) = Sum_{i=1..n} i * (2n - 2i + 1 - floor((n - i + 1)/2) ). - Wesley Ivan Hurt, Jan 23 2014
E.g.f.: (1/16)*(-exp(-x) + exp(x)*(1 + 14*x + 18*x^2 + 4*x^3)). - Stefano Spezia, Nov 29 2019
a(2*n) = (1/2)*( n*(n + 1)^3 - (n - 1)*n^3 ); a(2*n-1) = (1/2)*( (n + 1)*n^3 - n*(n - 1)^3 ) (note: replacing the exponent 3 with 2 throughout gives the sequence of generalized pentagonal numbers A001318). - Peter Bala, Aug 11 2021
a(2n-1) = A213772(n). - R. J. Mathar, Mar 02 2025
(n-2)*a(n) -3*a(n-1) -(n+1)*a(n-2) +2*n-1 =0. - R. J. Mathar, Mar 09 2025

Error in n=8 term corrected May 15 1997

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

A024702 a(n) = (prime(n)^2 - 1)/24.

Original entry on oeis.org

1, 2, 5, 7, 12, 15, 22, 35, 40, 57, 70, 77, 92, 117, 145, 155, 187, 210, 222, 260, 287, 330, 392, 425, 442, 477, 495, 532, 672, 715, 782, 805, 925, 950, 1027, 1107, 1162, 1247, 1335, 1365, 1520, 1552, 1617, 1650, 1855, 2072, 2147, 2185, 2262, 2380, 2420, 2625, 2752, 2882, 3015

Offset: 3

Clark Kimberling, Dec 11 1999

Note that p^2 - 1 is always divisible by 24 since p == 1 or 2 (mod 3), so p^2 == 1 (mod 3) and p == 1, 3, 5, or 7 (mod 8) so p^2 == 1 (mod 8). - Michael B. Porter, Sep 02 2016
For n > 3 and m > 1, a(n) = A000330(m)/(2*m + 1), where 2*m + 1 = prime(n). For example, for m = 8, 2*m + 1 = 17 = prime(7), A000330(8) = 204, 204/17 = 12 = a(7). - Richard R. Forberg, Aug 20 2013
For primes => 5, a(n) == 0 or 2 (mod 5). - Richard R. Forberg, Aug 28 2013
The only primes in this sequence are 2, 5 and 7 (checked up to n = 10^7). The set of prime factors, however, appears to include all primes. - Richard R. Forberg, Feb 28 2015
Subsequence of generalized pentagonal numbers (cf. A001318): a(n) = k_n*(3*k_n - 1)/2, for k_n in {1, -1, 2, -2, 3, -3, 4, 5, -5, -6, 7, -7, 8, 9, 10, -10, ...} = A024699(n-2)*((A000040(n) mod 6) - 3)/2, n >= 3. - Daniel Forgues, Aug 02 2016
The only primes in this sequence are indeed 2, 5 and 7. For a prime p >= 5, if both p + 1 and p - 1 contains a prime factor > 3, then (p^2 - 1)/24 = (p + 1)*(p - 1)/24 contains at least 2 prime factors, so at least one of p +  1 and p - 1 is 3-smooth. Let's call it s. Also, If (p^2 - 1)/24 is a prime, then A001222(p^2-1) = 5. Since A001222(p+1) and A001222(p-1) are both at least 2, A001222(s) <= 5 - 2 = 3. From these we can see the only possible cases are p = 7, 11 and 13. - Jianing Song, Dec 28 2018

			For n = 6, the 6th prime is 13, so a(6) = (13^2 - 1)/24 = 168/24 = 7.

Charles R Greathouse IV, Table of n, a(n) for n = 3..10000
Brady Haran and Matt Parker, Squaring Primes, Numberphile video (2018).
Carlos Rivera, Puzzle 1060. Can you find more solutions?, The Prime Puzzles and Problems Connection. [Asks for squares in this sequence]

Subsequence of generalized pentagonal numbers A001318.

Cf. A075888.

A024702:=n->(ithprime(n)^2-1)/24: seq(A024702(n), n=3..70); # Wesley Ivan Hurt, Mar 01 2015

(Prime[Range[3,100]]^2-1)/24 (* Vladimir Joseph Stephan Orlovsky, Mar 15 2011 *)

a(n)=prime(n)^2\24 \\ Charles R Greathouse IV, May 30 2013

is(n)=my(k);issquare(24*n+1,&k)&&isprime(k) \\ Charles R Greathouse IV, May 31 2013

a(n) = (A000040(n)^2 - 1)/24 = (A001248(n) - 1)/24. - Omar E. Pol, Dec 07 2011
a(n) = A005097(n-1)*A006254(n-1)/6. - Bruno Berselli, Dec 08 2011
a(n) = A084920(n)/24. - R. J. Mathar, Aug 23 2013
a(n) = A127922(n)/A000040(n) for n >= 3. - César Aguilera, Nov 01 2019

A049452 Pentagonal numbers with even index.

Original entry on oeis.org

0, 5, 22, 51, 92, 145, 210, 287, 376, 477, 590, 715, 852, 1001, 1162, 1335, 1520, 1717, 1926, 2147, 2380, 2625, 2882, 3151, 3432, 3725, 4030, 4347, 4676, 5017, 5370, 5735, 6112, 6501, 6902, 7315, 7740, 8177, 8626, 9087, 9560, 10045, 10542

Offset: 0

Joe Keane (jgk(AT)jgk.org)

If Y is a 3-subset of an (2n+1)-set X then, for n>=4, a(n-1) is the number of 4-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 16 2007
Sequence found by reading the line (one of the diagonal axes) from 0, in the direction 0, 5,..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. - Omar E. Pol, Sep 08 2011
a(n) is the sum of 2*n consecutive integers starting from 2*n. - Bruno Berselli, Jan 16 2018

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

Cf. A000326, A033570, A049453, A001318, A033568, A185019.

See index to sequences with numbers of the form n*(d*n+10-d)/2 in A140090.

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

Table[n(6n-1),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,5,22},50] (* Harvey P. Dale, Mar 07 2012 *)

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

a(n) = n*(6*n-1).
G.f.: x*(5+7*x)/(1-x)^3.
a(n) = C(6*n,2)/3. - Zerinvary Lajos, Jan 02 2007
a(n) = A001105(n) + A033991(n) = A033428(n) + A049450(n) = A022266(n) + A000326(n). - Zerinvary Lajos, Jun 12 2007
a(n) = 12*n + a(n-1) - 7 for n>0, a(0)=0. - Vincenzo Librandi, Aug 06 2010
a(n) = 4*A000217(n) + A001107(n). - Bruno Berselli, Feb 11 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2, a(0)=0, a(1)=5, a(2)=22. - Harvey P. Dale, Mar 07 2012
E.g.f.: (6*x^2 + 5*x)*exp(x). - G. C. Greubel, Jul 17 2017
From Amiram Eldar, Jul 03 2020: (Start)
Sum_{n>=1} 1/a(n) = 2*log(2) + 3*log(3)/2 - sqrt(3)*Pi/2.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi - log(2) - 2*sqrt(3)*arccoth(sqrt(3)). (End)

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

cp's OEIS Frontend

A032528 Concentric hexagonal numbers: floor(3*n^2/2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

Extensions

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

A022567 Expansion of Product_{m>=1} (1+x^m)^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

SageMath

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

A019298 Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

Formula

Extensions

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

Views

Author

Keywords

Comments

Links

Crossrefs

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

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