A000700 -id:A000700 - cp's OEIS frontend

A008284 Triangle of partition numbers: T(n,k) = number of partitions of n in which the greatest part is k, 1 <= k <= n. Also number of partitions of n into k positive parts, 1 <= k <= n.

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 1, 1, 1, 3, 4, 3, 2, 1, 1, 1, 4, 5, 5, 3, 2, 1, 1, 1, 4, 7, 6, 5, 3, 2, 1, 1, 1, 5, 8, 9, 7, 5, 3, 2, 1, 1, 1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1, 1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1, 1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1, 1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1

Offset: 1

N. J. A. Sloane

From Frederik Beaujean (beaujean(AT)mpp.mpg.de), Apr 09 2010: (Start)
A000041(n+1) = 1 + Sum_{r=1..n} Sum_{k=1..min(r,n-r+1)} T(r,k).
T(n, n-k) is also the number of partitions of k in which the greatest part is at most n-k. (End)
From Richard R. Forberg, Dec 26 2014: (Start)
Elements of T(n, k) for n <= 2+3k, equal A000041(n-k) - A000070(n-2k-1), with the assumption A000070(n) = 0 for n < 0.
The diagonal T(2+2k, k), for k > 1 equals A007042, and the diagonal T(3+3k,k), for k >= 1, equals A104384. (End)
T(-n, k) is used as a definition for A380038, which can therefore be seen as an extension of this sequence for negative n. - Friedjof Tellkamp, Jan 18 2025

			The triangle T(n,k) begins:
   n\k 1  2  3  4  5  6  7  8  9 10 11 12 ...
   1:  1
   2:  1  1
   3:  1  1  1
   4:  1  2  1  1
   5:  1  2  2  1  1
   6:  1  3  3  2  1  1
   7:  1  3  4  3  2  1  1
   8:  1  4  5  5  3  2  1  1
   9:  1  4  7  6  5  3  2  1  1
  10:  1  5  8  9  7  5  3  2  1  1
  11:  1  5 10 11 10  7  5  3  2  1  1
  12:  1  6 12 15 13 11  7  5  3  2  1  1
... Reformatted and extended by _Wolfdieter Lang_, Dec 03 2012; additional extension by _Bob Selcoe_, Jun 09 2013
T(7,3) = 4 because we have [3,3,1], [3,2,2], [3,2,1,1] and [3,1,1,1,1], each having greatest part 3; or [5,1,1], [4,2,1], [3,3,1] and [3,2,2] each having 3 parts.
* Example from formula above: T(10,4) = 9 because T(6,4) + T(6,3) + T(6,2) + T(6,1) = 2 + 3 + 3 + 1 = 9.
* P(n) = P(n-1) + DT(n-1). P(n) = unordered partitions of n. (A000041) DT(n-1) = sum of diagonals beginning at T(n-1,1).
Example P(11) = 56, P(10) = 42, sum DT(10) = 1 + 4 + 5 + 3 + 1 = 14. - _Bob Selcoe_, Jun 09 2013
From _Omar E. Pol_, Nov 19 2019: (Start)
Illustration of initial terms: T(n,k) is also the number of vertical line segments in the k-th column of the n-th diagram, which represents the partitions of n:
.
    1    1 1    1 1 1    1 2 1 1    1 2 2 1 1    1 3 3 2 1 1    1 3 4 3 2 1 1
.
   _|   _| |   _| | |   _| | | |   _| | | | |   _| | | | | |   _| | | | | | |
        _ _|   _ _| |   _ _| | |   _ _| | | |   _ _| | | | |   _ _| | | | | |
               _ _ _|   _ _ _| |   _ _ _| | |   _ _ _| | | |   _ _ _| | | | |
                        _ _|   |   _ _|   | |   _ _|   | | |   _ _|   | | | |
                        _ _ _ _|   _ _ _ _| |   _ _ _ _| | |   _ _ _ _| | | |
                                   _ _ _|   |   _ _ _|   | |   _ _ _|   | | |
                                   _ _ _ _ _|   _ _ _ _ _| |   _ _ _ _ _| | |
                                                _ _|   |   |   _ _|   |   | |
                                                _ _ _ _|   |   _ _ _ _|   | |
                                                _ _ _|     |   _ _ _|     | |
                                                _ _ _ _ _ _|   _ _ _ _ _ _| |
                                                               _ _ _|   |   |
                                                               _ _ _ _ _|   |
                                                               _ _ _ _|     |
                                                               _ _ _ _ _ _ _|
(End)

L. Comtet, Advanced Combinatorics, Reidel, 1974, pp. 94, 96 and 307.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 219.
D. E. Knuth, The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions, Addison-Wesley Professional, 2005, pp. 38, 45, 50 [From Frederik Beaujean (beaujean(AT)mpp.mpg.de), Apr 09 2010]
D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.4, p. 400.
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section XIV.2, p. 493.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 294.

Franklin T. Adams-Watters, First 200 rows, flattened
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, p. 831. [scanned copy]
Henry Bottomley, Illustration of initial terms
D. J. Broadhurst and D. Kreimer, Towards cohomology of renormalization: bigrading the combinatorial Hopf algebra of rooted trees, arXiv:hep-th/0001202, 2000.
FindStat - Combinatorial Statistic Finder, The length of the partition
Martin Griffiths, Generating Functions for Extended Stirling Numbers of the First Kind, Journal of Integer Sequences, 17 (2014), #14.6.4.
Roser Homs and Anna-Lena Winz, Deformations of local Artin rings via Hilbert-Burch matrices, arXiv:2309.06871 [math.AC], 2023. See p. 16.
Wolfdieter Lang, First 10 rows and more.
T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. [Annotated, scanned copy]
OEIS Wiki, Sorting numbers
Tilman Piesk, Illustration of initial terms
Stephan Scholz and Lothar Berger, Fast computation of function composition derivatives for flatness-based control of diffusion problems, J. Math. Industry (2024) Vol. 14, Art. No. 15.
Teerapat Srichan, Watcharapon Pimsert, and Vichian Laohakosol, New Recursion Formulas for the Partition Function, J. Int. Seq., Vol. 24 (2021), Article 21.6.6.
Eric Weisstein's World of Mathematics, Partition Function P
Index entries for triangles generated by the Multiset Transformation

A000041 is row sums and diagonal.
Columns k=1-10 are: A057427, A004526, A069905, A026810, A026811, A026812, A026813, A026814, A026815, A026816.
Partial sums of rows gives A026820.
Cf. A038497, A038498, A039805-A039809, A060016, A126988, A380038.
Read from right to left gives A058398.
Subtriangle of A072233 without row n=0 and column m=0.
Cf. A007042, A104384 which are diagonals with slope -2, -3.

a008284 n k = a008284_tabl !! (n-1) !! (k-1)
a008284_row n = a008284_tabl !! (n-1)
a008284_tabl = [1] : f [[1]] where
   f xss = ys : f (ys : xss) where
     ys = (map sum $ zipWith take [1..] xss) ++ [1]
-- Reinhard Zumkeller, Sep 05 2014

G:=-1+1/product(1-t*x^j,j=1..15): Gser:=simplify(series(G,x=0,17)): for n from 1 to 14 do P[n]:=coeff(Gser,x^n) od: for n from 1 to 14 do seq(coeff(P[n],t^j),j=1..n) od; # yields sequence in triangular form; Emeric Deutsch, Feb 12 2006
with(combstruct):for n from 0 to 18 do seq(count(Partition(n), size=m), m = 1 .. n) od; # Zerinvary Lajos, Mar 30 2009
T := proc(n,k) option remember; if k < 0 or n < 0 then 0 elif k = 0 then if n = 0 then 1 else 0 fi else T(n - 1, k - 1) + T(n - k, k) fi end: seq(print(seq(T(n, k), k=1..n)),n=1..14); # Peter Luschny, Jul 24 2011

Column[Table[ IntegerPartitions[n, {k}] // Length, {n, 1, 20}, {k, 1, n}], Center] (* Frederik Beaujean (beaujean(AT)mpp.mpg.de), Apr 09 2010 *)
(*Recurrence closely related to natural numbers and number of divisors of n*)
Clear[t]; nn = 14; t[n_, 1] = 1; t[n_, k_] := t[n, k] = If[n >= k, Sum[t[n - i, k - 1], {i, 1, n - 1}] - Sum[t[n - i, k], {i, 1, k - 1}], 0];Flatten[Table[Table[t[n, k], {k, 1, n}], {n, 1, nn}]][[1 ;; 96]] (* Mats Granvik, Jan 01 2015 *)
Table[SeriesCoefficient[1/QPochhammer[a q, q], {q, 0, n}, {a, 0, k}], {n, 1, 15}, {k, 1, n}] // Column (* Vladimir Reshetnikov, Nov 18 2016 *)
T[n_, k_] := T[n, k] = If[n>0 && k>0, T[n-1, k-1] + T[n-k, k], Boole[n==0 && k==0]]
Table[T[n, k], {n, 1, 20}, {k, 1, n}] // Flatten (* Robert A. Russell, May 12 2018 after Knuth 7.2.1.4 (39) *)

T(n,k)=#partitions(n-k,k)
for(n=1,9,for(k=1,n,print1(T(n,k)", "))) \\ Charles R Greathouse IV, Jan 04 2016

A8284=[]; A008284(n,k)={for(n=#A8284+1,n,A8284=concat(A8284,[vector(n,k,if(2*k1,A8284[n-k][k]+A8284[n-1][k-1],1),numbpart(n-k)))]));if(k,A8284[n][k],A8284[n])} \\ Without 2nd argument, return row n. - M. F. Hasler, Sep 26 2017

from functools import lru_cache
@lru_cache(maxsize=None)
def A008284_T(n,k):
    if k==n or k==1: return 1
    if k>n: return 0
    return A008284_T(n-1,k-1)+A008284_T(n-k,k) # Chai Wah Wu, Sep 21 2023

from sage.combinat.partition import number_of_partitions_length
[[number_of_partitions_length(n, k) for k in (1..n)] for n in (1..12)] # Peter Luschny, Aug 01 2015

T(n, k) = Sum_{i=1..k} T(n-k, i), for 1 <= k <= n-1; T(n, n) = 1 for n >= 1.
Or, T(n, 1) = T(n, n) = 1, T(n, k) = 0 (k > n), T(n, k) = T(n-1, k-1) + T(n-k, k).
G.f. for k-th column: x^k/(Product_{j=1..k} (1-x^j)). - Wolfdieter Lang, Nov 29 2000
G.f.: A(x, y) = Product_{n>=1} 1/(1-x^n)^(P_n(y)/n), where P_n(y) = Sum_{d|n} eulerphi(n/d)*y^d. - Paul D. Hanna, Jul 13 2004
If k >= n/2, T(n,k) = T(2(n-k),n-k) = A000041(n-k). - Franklin T. Adams-Watters, Jan 12 2006  [Relation included by Hans Loeblich, Apr 16 2019, relation extended by Evan Robinson, Jun 30 2021]
G.f.: G(t,x) = -1 + 1/Product_{j>=1} (1-t*x^j). - Emeric Deutsch, Feb 12 2006
A002865(n) = Sum_{k=2..floor((n+2)/2)} T(n-k+1,k-1). - Reinhard Zumkeller, Nov 04 2007
A000700(n) = Sum_{k=1..n} (-1)^(n-k) T(n,k). - Jeremy L. Martin, Jul 06 2013
G.f.: -1 + e^(F(x,z)), where F(x,z) = Sum_{n >= 1} (x*z)^n/(n*(1 - z^n)) is a g.f. for A126988. - Peter Bala, Jan 13 2015
Also, T(n, n-k) = k for k = 1, 2, 3; n >= 2k. T(n, 2) = floor(n/2). T(n, 3) = round(n^2/12). - M. F. Hasler, Sep 26 2017
T(n,k) = [n>0 & k>0] * (T(n-1,k-1) + T(n-k,k)) + [n==0 & k==0]. - Robert A. Russell, May 12 2018 from Knuth 7.2.1.4 (39)
T(n, k) = Sum_{i=0..n-1} T(n-ik-1, k-1) for k >= 1; T(-n, k) = 0 for n > 0; T(n, 0) = [n==0]. - Joshua Swanson (writing for Juexian Li), May 24 2020

A000085 Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.

Original entry on oeis.org

1, 1, 2, 4, 10, 26, 76, 232, 764, 2620, 9496, 35696, 140152, 568504, 2390480, 10349536, 46206736, 211799312, 997313824, 4809701440, 23758664096, 119952692896, 618884638912, 3257843882624, 17492190577600, 95680443760576, 532985208200576, 3020676745975552

Offset: 0

N. J. A. Sloane and J. H. Conway

a(n) is also the number of n X n symmetric permutation matrices.
a(n) is also the number of matchings (Hosoya index) in the complete graph K(n). - Ola Veshta (olaveshta(AT)my-deja.com), Mar 25 2001
a(n) is also the number of independent vertex sets and vertex covers in the n-triangular graph. - Eric W. Weisstein, May 22 2017
Equivalently, this is the number of graphs on n labeled nodes with degrees at most 1. - Don Knuth, Mar 31 2008
a(n) is also the sum of the degrees of the irreducible representations of the symmetric group S_n. - Avi Peretz (njk(AT)netvision.net.il), Apr 01 2001
a(n) is the number of partitions of a set of n distinguishable elements into sets of size 1 and 2. - Karol A. Penson, Apr 22 2003
Number of tableaux on the edges of the star graph of order n, S_n (sometimes T_n). - Roberto E. Martinez II, Jan 09 2002
The Hankel transform of this sequence is A000178 (superfactorials). Sequence is also binomial transform of the sequence 1, 0, 1, 0, 3, 0, 15, 0, 105, 0, 945, ... (A001147 with interpolated zeros). - Philippe Deléham, Jun 10 2005
Row sums of the exponential Riordan array (e^(x^2/2),x). - Paul Barry, Jan 12 2006
a(n) is the number of nonnegative lattice paths of upsteps U = (1,1) and downsteps D = (1,-1) that start at the origin and end on the vertical line x = n in which each downstep (if any) is marked with an integer between 1 and the height of its initial vertex above the x-axis. For example, with the required integer immediately preceding each downstep, a(3) = 4 counts UUU, UU1D, UU2D, U1DU. - David Callan, Mar 07 2006
Equals row sums of triangle A152736 starting with offset 1. - Gary W. Adamson, Dec 12 2008
Proof of the recurrence relation a(n) = a(n-1) + (n-1)*a(n-2): number of involutions of [n] containing n as a fixed point is a(n-1); number of involutions of [n] containing n in some cycle (j, n), where 1 <= j <= n-1, is (n-1) times the number of involutions of [n] containing the cycle (n-1 n) = (n-1)*a(n-2). - Emeric Deutsch, Jun 08 2009
Number of ballot sequences (or lattice permutations) of length n. A ballot sequence B is a string such that, for all prefixes P of B, h(i) >= h(j) for i < j, where h(x) is the number of times x appears in P. For example, the ballot sequences of length 4 are 1111, 1112, 1121, 1122, 1123, 1211, 1212, 1213, 1231, and 1234. The string 1221 does not appear in the list because in the 3-prefix 122 there are two 2's but only one 1. (Cf. p. 176 of Bruce E. Sagan: "The Symmetric Group"). - Joerg Arndt, Jun 28 2009
Number of standard Young tableaux of size n; the ballot sequences are obtained as a length-n vector v where v_k is the (number of the) row in which the number r occurs in the tableaux. - Joerg Arndt, Jul 29 2012
Number of factorial numbers of length n-1 with no adjacent nonzero digits. For example the 10 such numbers (in rising factorial radix) of length 3 are 000, 001, 002, 003, 010, 020, 100, 101, 102, and 103. - Joerg Arndt, Nov 11 2012
Also called restricted Stirling numbers of the second kind (see Mezo). - N. J. A. Sloane, Nov 27 2013
a(n) is the number of permutations of [n] that avoid the consecutive patterns 123 and 132. Proof. Write a self-inverse permutation in standard cycle form: smallest entry in each cycle in first position, first entries decreasing. For example, (6,7)(3,4)(2)(1,5) is in standard cycle form. Then erase parentheses. This is a bijection to the permutations that avoid consecutive 123 and 132 patterns. - David Callan, Aug 27 2014
Getu (1991) says these numbers are also known as "telephone numbers". - N. J. A. Sloane, Nov 23 2015
a(n) is the number of elements x in the symmetric group S_n such that x^2 = e where e is the identity. - Jianing Song, Aug 22 2018 [Edited on Jul 24 2025]
a(n) is the number of congruence orbits of upper-triangular n X n matrices on skew-symmetric matrices, or the number of Borel orbits in largest sect of the type DIII symmetric space SO_{2n}(C)/GL_n(C). Involutions can also be thought of as fixed-point-free partial involutions. See [Bingham and Ugurlu] link. - Aram Bingham, Feb 08 2020
From Thomas Anton, Apr 20 2020: (Start)
Apparently a(n) = b*c where b is odd iff a(n+b) (when a(n) is defined) is divisible by b.
Apparently a(n) = 2^(f(n mod 4)+floor(n/4))*q where f:{0,1,2,3}->{0,1,2} is given by f(0),f(1)=0, f(2)=1 and f(3)=2 and q is odd. (End)
From Iosif Pinelis, Mar 12 2021: (Start)
a(n) is the n-th initial moment of the normal distribution with mean 1 and variance 1. This follows because the moment generating function of that distribution is the e.g.f. of the sequence of the a(n)'s.
The recurrence a(n) = a(n-1) + (n-1)*a(n-2) also follows, by writing E(Z+1)^n=EZ(Z+1)^(n-1)+E(Z+1)^(n-1), where Z is a standard normal random variable, and then taking the first of the latter two integrals by parts. (End)

			Sequence starts 1, 1, 2, 4, 10, ... because possibilities are {}, {A}, {AB, BA}, {ABC, ACB, BAC, CBA}, {ABCD, ABDC, ACBD, ADCB, BACD, BADC, CBAD, CDAB, DBCA, DCBA}. - _Henry Bottomley_, Jan 16 2001
G.f. = 1 + x + 2*x^2 + 4*x^4 + 10*x^5 + 26*x^6 + 76*x^7 + 232*x^8 + 764*x^9 + ...
From _Gus Wiseman_, Jan 08 2021: (Start)
The a(4) = 10 standard Young tableaux:
  1 2 3 4
.
  1 2   1 3   1 2 3   1 2 4   1 3 4
  3 4   2 4   4       3       2
.
  1 2   1 3   1 4
  3     2     2
  4     4     3
.
  1
  2
  3
  4
The a(0) = 1 through a(4) = 10 set partitions into singletons or pairs:
  {}  {{1}}  {{1,2}}    {{1},{2,3}}    {{1,2},{3,4}}
             {{1},{2}}  {{1,2},{3}}    {{1,3},{2,4}}
                        {{1,3},{2}}    {{1,4},{2,3}}
                        {{1},{2},{3}}  {{1},{2},{3,4}}
                                       {{1},{2,3},{4}}
                                       {{1,2},{3},{4}}
                                       {{1},{2,4},{3}}
                                       {{1,3},{2},{4}}
                                       {{1,4},{2},{3}}
                                       {{1},{2},{3},{4}}
(End)

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, pages 32, 911.
S. Chowla, The asymptotic behavior of solutions of difference equations, in Proceedings of the International Congress of Mathematicians (Cambridge, MA, 1950), Vol. I, 377, Amer. Math. Soc., Providence, RI, 1952.
W. Fulton, Young Tableaux, Cambridge, 1997.
D. E. Knuth, The Art of Computer Programming, Vol. 3, Section 5.1.4, p. 65.
L. C. Larson, The number of essentially different nonattacking rook arrangements, J. Recreat. Math., 7 (No. 3, 1974), circa pages 180-181.
T. Muir, A Treatise on the Theory of Determinants. Dover, NY, 1960, p. 6.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 86.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.10.

Alois P. Heinz, Table of n, a(n) for n = 0..800 (first 101 terms from T. D. Noe)
Ahmad Zainy Al-Yasry, Short Steps in Noncommutative Geometry, arXiv:1901.03640 [math.OA], 2019.
T. Amdeberhan and V. H. Moll, Involutions and their progenies, 2014.
David Applegate and N. J. A. Sloane, The Gift Exchange Problem arXiv:0907.0513 [math.CO], 2009.
Joerg Arndt, Generating Random Permutations, PhD thesis, Australian National University, Canberra, Australia, (2010).
Joerg Arndt, Matters Computational (The Fxtbook), pp. 279-280.
C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, Generating Functions for Generating Trees, Discrete Mathematics 246(1-3), March 2002, pp. 29-55.
D. Barsky, Analyse p-adique et suites classiques de nombres, Sem. Loth. Comb. B05b (1981) 1-21.
C. Bebeacua, T. Mansour, A. Postnikov and S. Severini, On the X-rays of permutations, arXiv:math/0506334 [math.CO], 2005.
E. A. Bender and S. G. Williamson, Foundations of Combinatorics with Applications (see Chap. 2, Example 2.9, pp. 47-48, including Theorem 2.2, a derived formula for a(n)). [From _Rick L. Shepherd_, Sep 02 2009]
S. Bilotta, E. Pergola, R. Pinzani, and S. Rinaldi, Recurrence relations versus succession rules, arXiv preprint arXiv:1301.2967 [cs.DM], 2013. - From _N. J. A. Sloane_, Feb 12 2013
S. Bilotta, E. Pergola, R. Pinzani, and S. Rinaldi, Recurrence Relations, Succession Rules, and the Positivity Problem, in Language and Automata Theory and Applications, 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, Pages 499-510, Lecture Notes Comp. Sci. Vol. 8977.
Aram Bingham and Özlem Uğurlu, Sects, rooks, pyramids, partitions and paths for type DIII clans, arXiv:1907.08875 [math.CO], 2019.
Anders Björner and Richard P. Stanley, A combinatorial miscellany, 2010.
P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, Combinatorial field theories via boson normal ordering, arXiv:quant-ph/0405103, 2004-2006. The title of this paper in the arXiv was later changed to "Some useful combinatorial formulas for bosonic operators"
P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, Some useful combinatorial formulas for bosonic operators, J. Math. Phys. 46, 052110 (2005) (6 pages).
Tobias Boege and Thomas Kahle, Construction Methods for Gaussoids, arXiv:1902.11260 [math.CO], 2019.
D. Bundala, M. Codish, L. Cruz-Filipe et al., Optimal-Depth Sorting Networks, arXiv preprint arXiv:1412.5302 [cs.DS], 2014.
Alexander Burstein and Louis W. Shapiro, Pseudo-involutions in the Riordan group, arXiv:2112.11595 [math.CO], 2021.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
D. Castellanos, A generalization of Binet's formula and some of its consequences, Fib. Quart., 27 (1989), 424-438.
C.-O. Chow, Counting involutory, unimodal and alternating signed permutations, Discr. Math. 306 (2006), 2222-2228.
S. Chowla, and I.N. Hernstein, W.K. Moore, On recursions connected with symmetric groups. I, Canadian Journal of Mathematics, 3 (1951), 328-334.
M. Codish, L. Cruz-Filipe and P. Schneider-Kamp, The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes, arXiv preprint arXiv:1404.0948 [cs.DS], 2014.
Tom Copeland, Infinitesimal Generators, the Pascal Pyramid, and the Witt and Virasoro Algebras
Filippo Disanto and Thomas Wiehe, Some instances of a sub-permutation problem on pattern avoiding permutations, arXiv preprint arXiv:1210.6908 [math.CO], 2012.
I. Dolinka, J. East, A. Evangelou, D. FitzGerald, N. Ham, et al., Enumeration of idempotents in diagram semigroups and algebras, arXiv preprint arXiv:1408.2021 [math.GR], 2014.
I. Dolinka, J. East, and R. D. Gray, Motzkin monoids and partial Brauer monoids, arXiv preprint arXiv:1512.02279 [math.GR], 2015-2016.
R. Donaghey, Binomial self-inverse sequences and tangent coefficients, J. Combin. Theory, Series A, 21 (1976), 155-163.
S. Dulucq and J.-G. Penaud, Cordes, arbres et permutations, Discrete Math. 117 (1993), no. 1-3, 89-105.
Shalosh B. Ekhad, Manuel Kauers, and Doron Zeilberger, The O(1/n^85) Asymptotic expansion of OEIS sequence A85, arxiv preprint arXiv:2410.16334 [math.CO], October 2024.
Shalosh B. Ekhad and Doron Zeilberger, Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux
Shalosh B. Ekhad and Doron Zeilberger, Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux, [Local copy, pdf file only, no active links]
Shalosh B. Ekhad and Doron Zeilberger, Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux, arXiv preprint arXiv:1202.6229 [math.CO], 2012. [This is a different document from the one with the same title on Doron Zeilberger's web site]
Shalosh B. Ekhad, Manuel Kauers, and Doron Zeilberger, The O(1/n^85) Asymptotic expansion of OEIS sequence A85, arXiv:2410.16334 [math.CO], 2024.
FindStat - Combinatorial Statistic Finder, Standard Young tableaux
Amy M. Fu and Frank Z. K. Li, Joint Distributions of Permutation Statistics and the Parabolic Cylinder Functions, arXiv:1809.07465 [math.CO], 2018.
Mohammad Ganjtabesh, Armin Morabbi and Jean-Marc Steyaert, Enumerating the number of RNA structures
S. Garrabrant and I. Pak, Counting with irrational tiles, arXiv:1407.8222 [math.CO], 2014.
S. Getu, Evaluating determinants via generating functions, Mathematics Magazine 64 (1991), 45-53.
J. Gilder, Rooks inviolate revisited II, Math. Gaz., 70 (1986), 44-45.
A. M. Goyt, Avoidance of partitions of a 3-element set, arXiv:math/0603481 [math.CO], 2006.
Greenhill, Catherine; McKay, Brendan D., Counting loopy graphs with given degree, Linear Algebra Appl. 436, No. 4, 901-926 (2012)
H. Gupta, Enumeration of symmetric matrices, Duke Math. J., 35 (1968), vol 3, 653-659
H. Gupta, Enumeration of symmetric matrices (annotated scanned copy)
C. Gutschwager, Reduced Kronecker products which are multiplicity free or contain only a few components, Eur. J. Combinat. 31 (2010) 1996-2005 doi:10.1016/j.ejc.2010.05.008, Remark 2.13.
T. Halverson and M. Reeks, Gelfand Models for Diagram Algebras, arXiv preprint arXiv:1302.6150 [math.RT], 2013.
Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
A. Horzela, P. Blasiak, G. E. H. Duchamp, K. A. Penson and A. I. Solomon, A product formula and combinatorial field theory, arXiv:quant-ph/0409152, 2004.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 17
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 22
András Kaszanyitzky, The GraftalLace Cellular Automaton, arXiv:1805.11532 [nlin.CG], 2018.
Manuel Kauers, Doron Zeilberger, Counting Standard Young Tableaux With Restricted Runs, arXiv:2006.10205 [math.CO], 2020.
Dongsu Kim and Jang Soo Kim, A combinatorial approach to the power of 2 in the number of involutions, J. Comb. Theory Ser. A 117 (8) (2010): 1082-1094
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 227.
P. L. Krapivsky and J. M. Luck, Coverage fluctuations in theater models, arXiv:1902.04365 [cond-mat.stat-mech], 2019.
M. B. Kutler and C. R. Vinroot, On q-Analogs of Recursions for the Number of Involutions and Prime Order Elements in Symmetric Groups, JIS 13 (2010) #10.3.6.
Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
L. C. Larson, The number of essentially different nonattacking rook arrangements, J. Recreat. Math., 7 (No. 3, 1974), circa pages 180-181. [Annotated scan of pages 180 and 181 only]
J. W. Layman, The Hankel Transform and Some of its Properties, J. Integer Sequences, 4 (2001), #01.1.5.
Steven Linton, James Propp, Tom Roby, and Julian West, Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions, Journal of Integer Sequences, Vol. 15 (2012), #12.9.1.
E. Lucas, Théorie des Nombres, Gauthier-Villars, Paris, 1891, Vol. 1, p. 221.
E. Lucas, Théorie des nombres (annotated scans of a few selected pages)
T. Mansour and M. Shattuck, Partial matchings and pattern avoidance, Appl. Anal. Discrete Math. (to appear, 2012); - From _N. J. A. Sloane_, Jan 04 2013
I. Mezo, Periodicity of the last digits of some combinatorial sequences, arXiv preprint arXiv:1308.1637 [math.CO], 2013 and J. Int. Seq. 17 (2014) #14.1.1.
F. L. Miksa, L. Moser and M. Wyman, Restricted partitions of finite sets, Canad. Math. Bull., 1 (1958), 87-96.
L. Moser and M. Wyman, On solutions of x^d = 1 in symmetric groups, Canad. J. Math., 7 (1955), 159-168.
T. Mueller, Finite group actions and asymptotic expansion of e^P(z), Combinatorica, 17 (4) (1997), 523-554.
Igor Pak, Complexity problems in enumerative combinatorics, arXiv:1803.06636 [math.CO], 2018.
I. Pak, G. Panova, and E. Vallejo, Kronecker products, characters, partitions, and the tensor square conjectures, arXiv:1304.0738 [math.CO], 2013.
D. Panyushev, On the orbits of a Borel subgroup in abelian ideals, arXiv preprint arXiv:1407.6857 [math.AG], 2014.
P. Peart and W.-J. Woan, Generating Functions via Hankel and Stieltjes Matrices, J. Integer Seqs., Vol. 3 (2000), #00.2.1.
R. Petuchovas, Asymptotic analysis of the cyclic structure of permutations, arXiv:1611.02934 [math.CO], p. 6, 2016.
R. A. Proctor, Let's Expand Rota's Twelvefold Way for Counting Partitions!, arXiv:math/0606404 [math.CO], 2006-2007.
J. L. Ramírez and G. N. Rubiano, Properties and Generalizations of the Fibonacci Word Fractal, The Mathematica Journal, Vol. 16 (2014).
J. Riordan, Letter to N. J. A. Sloane, Feb 03 1975 (with notes by njas)
R. W. Robinson, Counting arrangements of bishops, Lect. Notes Math. 560 (1976), 198-214. See D_n.
H. A. Rothe, Ueber Permutationen, in Beziehung auf die Stellen ihrer Elemente. Anwendung der daraus abgeleiteten Sätze auf das Eliminationsproblem, in Carl Hindenberg, ed., Sammlung Combinatorisch-Analytischer Abhandlungen, pp. 263-305, Bey G. Fleischer dem jüngern, 1800; see p. 282.
Ahmad Sabri and Vincent Vajnovszki, Exhaustive generation for ballot sequences in lexicographic and Gray code order, CEUR Workshop Proceedings, 2018.
Ahmad Sabri and Vincent Vajnovszki, On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order, Pure Mathematics and Applications (2019) Vol. 28, Issue 1, 109-119.
A. I. Solomon, P. Blasiak, G. Duchamp, A. Horzela and K. A. Penson, Combinatorial physics, normal order and model Feynman graphs, arXiv:quant-ph/0310174, 2003.
Bridget Eileen Tenner, Star factorizations and noncrossing partitions, arXiv:2004.03286 [math.CO], 2020.
Robert F. Tichy and Stephan Wagner, Extremal Problems for Topological Indices in Combinatorial Chemistry, Journal of Computational Biology. September 2005, 12(7): 1004-1013.
Eric Weisstein's World of Mathematics, Complete Graph
Eric Weisstein's World of Mathematics, Hosoya Index
Eric Weisstein's World of Mathematics, Independent Edge Set
Eric Weisstein's World of Mathematics, Independent Vertex Set
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Permutation Involution
Eric Weisstein's World of Mathematics, Triangular Graph
Eric Weisstein's World of Mathematics, Vertex Cover
Eric Weisstein's World of Mathematics, Young Tableau
Allan Wentink, Symmetry with Independent Blocks, on the late Ralph E. Griswold webpage of sample-chapters of an unfinished book about weaving, http://www.cs.arizona.edu/patterns/weaving/webdocs.html. [Cached copy]
Wikipedia, Telephone numbers.
Wikipedia, Young tableau.
Index entries for "core" sequences
Index entries for sequences related to Young tableaux.
Index entries for related partition-counting sequences

Cf. A001147, A001470, A053529, A099174, A136281-A136283, A001680, A001681.
See also A005425 for another version of the switchboard problem.
Equals 2 * A001475(n-1) for n>1.
First column of array A099020.
A069943(n+1)/A069944(n+1) = a(n)/A000142(n) in lowest terms.
Cf. A152736, A128229. - Gary W. Adamson, Dec 12 2008
Diagonal of A182172. - Alois P. Heinz, May 30 2012
Cf. A001813, A006882, A135401, A297708. - Manfred Scheucher, Jan 07 2018
Row sums of: A047884, A049403, A096713 (absolute value), A100861, A104556 (absolute value), A111924, A117506 (M_4 numbers), A122848, A238123.
A320663/A339888 count unlabeled multiset partitions into singletons/pairs.
A322661 counts labeled covering half-loop-graphs.
A339742 counts factorizations into distinct primes or squarefree semiprimes.
Cf. A000110, A000258, A000700, A000701, A321729, A321730, A321737.

a000085 n = a000085_list !! n
  a000085_list = 1 : 1 : zipWith (+)
    (zipWith (*) [1..] a000085_list) (tail a000085_list) -- Reinhard Zumkeller, May 16 2013

A000085 := proc(n) option remember; if n=0 then 1 elif n=1 then 1 else procname(n-1)+(n-1)*procname(n-2); fi; end;
with(combstruct):ZL3:=[S,{S=Set(Cycle(Z,card<3))}, labeled]:seq(count(ZL3,size=n),n=0..25); # Zerinvary Lajos, Sep 24 2007
with (combstruct):a:=proc(m) [ZL, {ZL=Set(Cycle(Z, m>=card))}, labeled]; end: A:=a(2):seq(count(A, size=n), n=0..25); # Zerinvary Lajos, Jun 11 2008

<Roger L. Bagula, Oct 06 2006 *)
With[{nn=30},CoefficientList[Series[Exp[x+x^2/2],{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, May 28 2013 *)
a[ n_] := Sum[(2 k - 1)!! Binomial[ n, 2 k], {k, 0, n/2}]; (* Michael Somos, Jun 01 2013 *)
a[ n_] := If[ n < 0, 0, HypergeometricU[ -n/2, 1/2, -1/2] / (-1/2)^(n/2)]; (* Michael Somos, Jun 01 2013 *)
a[ n_] := If[ n < 0, 0, n! SeriesCoefficient[ Exp[ x + x^2 / 2], {x, 0, n}]]; (* Michael Somos, Jun 01 2013 *)
Table[(I/Sqrt[2])^n HermiteH[n, -I/Sqrt[2]], {n, 0, 100}] (* Emanuele Munarini, Mar 02 2016 *)
a[n_] := Sum[StirlingS1[n, k]*2^k*BellB[k, 1/2], {k, 0, n}]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Jul 18 2017, after Emanuele Munarini *)
RecurrenceTable[{a[n] == a[n-1] + (n-1)*a[n-2], a[0] == 1, a[1] == 1}, a, {n, 0, 20}] (* Joan Ludevid, Jun 17 2022 *)
sds[{}]:={{}};sds[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sds[Complement[set,s]]]/@Cases[Subsets[set,{1,2}],{i,_}]; Table[Length[sds[Range[n]]],{n,0,10}] (* Gus Wiseman, Jan 11 2021 *)

B(n,x):=sum(stirling2(n,k)*x^k,k,0,n);
  a(n):=sum(stirling1(n,k)*2^k*B(k,1/2),k,0,n);
  makelist(a(n),n,0,40); /* Emanuele Munarini, May 16 2014 */

makelist((%i/sqrt(2))^n*hermite(n,-%i/sqrt(2)),n,0,12); /* Emanuele Munarini, Mar 02 2016 */

{a(n) = if( n<0, 0, n! * polcoeff( exp( x + x^2 / 2 + x * O(x^n)), n))}; /* Michael Somos, Nov 15 2002 */

N=66; x='x+O('x^N); egf=exp(x+x^2/2); Vec(serlaplace(egf)) \\ Joerg Arndt, Mar 07 2013

from math import factorial
def A000085(n): return sum(factorial(n)//(factorial(n-(k<<1))*factorial(k)*(1<>1)+1)) # Chai Wah Wu, Aug 31 2023

A000085 = lambda n: hypergeometric([-n/2,(1-n)/2], [], 2)
[simplify(A000085(n)) for n in range(28)] # Peter Luschny, Aug 21 2014

def a85(n): return sum(factorial(n) / (factorial(n-2*k) * 2**k * factorial(k)) for k in range(1+n//2))
for n in range(100): print(n, a85(n)) # Manfred Scheucher, Jan 07 2018

D-finite with recurrence a(0) = a(1) = 1, a(n) = a(n-1) + (n-1)*a(n-2) for n>1.
E.g.f.: exp(x+x^2/2).
a(n) = a(n-1) + A013989(n-2) = A013989(n)/(n+1) = 1+A001189(n).
a(n) = Sum_{k=0..floor(n/2)} n!/((n-2*k)!*2^k*k!).
a(m+n) = Sum_{k>=0} k!*binomial(m, k)*binomial(n, k)*a(m-k)*a(n-k). - Philippe Deléham, Mar 05 2004
For n>1, a(n) = 2*(A000900(n) + A000902(floor(n/2))). - Max Alekseyev, Oct 31 2015
The e.g.f. y(x) satisfies y^2 = y''y' - (y')^2.
a(n) ~ c*(n/e)^(n/2)exp(n^(1/2)) where c=2^(-1/2)exp(-1/4). [Chowla]
a(n) = HermiteH(n, 1/(sqrt(2)*i))/(-sqrt(2)*i)^n, where HermiteH are the Hermite polynomials. - Karol A. Penson, May 16 2002
a(n) = Sum_{k=0..n} A001498((n+k)/2, (n-k)/2)(1+(-1)^(n-k))/2. - Paul Barry, Jan 12 2006
For asymptotics see the Robinson paper.
a(n) = Sum_{m=0..n} A099174(n,m). - Roger L. Bagula, Oct 06 2006
O.g.f.: A(x) = 1/(1-x-1*x^2/(1-x-2*x^2/(1-x-3*x^2/(1-... -x-n*x^2/(1- ...))))) (continued fraction). - Paul D. Hanna, Jan 17 2006
From Gary W. Adamson, Dec 29 2008: (Start)
a(n) = (n-1)*a(n-2) + a(n-1); e.g., a(7) = 232 = 6*26 + 76.
Starting with offset 1 = eigensequence of triangle A128229. (End)
a(n) = (1/sqrt(2*Pi))*Integral_{x=-oo..oo} exp(-x^2/2)*(x+1)^n. - Groux Roland, Mar 14 2011
Row sums of |A096713|. a(n) = D^n(exp(x)) evaluated at x = 0, where D is the operator sqrt(1+2*x)*d/dx. Cf. A047974 and A080599. - Peter Bala, Dec 07 2011
From Sergei N. Gladkovskii, Dec 03 2011 - Oct 28 2013: (Start)
Continued fractions:
E.g.f.: 1+x*(2+x)/(2*G(0)-x*(2+x)) where G(k)=1+x*(x+2)/(2+2*(k+1)/G(k+1)).
G.f.: 1/(U(0) - x) where U(k) = 1 + x*(k+1) - x*(k+1)/(1 - x/U(k+1)).
G.f.: 1/Q(0) where Q(k) = 1 + x*k - x/(1 - x*(k+1)/Q(k+1)).
G.f.: -1/(x*Q(0)) where Q(k) = 1 - 1/x - (k+1)/Q(k+1).
G.f.: T(0)/(1-x) where T(k) = 1 - x^2*(k+1)/( x^2*(k+1) - (1-x)^2/T(k+1)). (End)
a(n) ~ (1/sqrt(2)) * exp(sqrt(n)-n/2-1/4) * n^(n/2) * (1 + 7/(24*sqrt(n))). - Vaclav Kotesovec, Mar 07 2014
a(n) = Sum_{k=0..n} s(n,k)*(-1)^(n-k)*2^k*B(k,1/2), where the s(n,k) are (signless) Stirling numbers of the first kind, and the B(n,x) = Sum_{k=0..n} S(n,k)*x^k are the Stirling polynomials, where the S(n,k) are the Stirling numbers of the second kind. - Emanuele Munarini, May 16 2014
a(n) = hyper2F0([-n/2,(1-n)/2],[],2). - Peter Luschny, Aug 21 2014
0 = a(n)*(+a(n+1) + a(n+2) - a(n+3)) + a(n+1)*(-a(n+1) + a(n+2)) for all n in Z. - Michael Somos, Aug 22 2014
From Peter Bala, Oct 06 2021: (Start)
a(n+k) == a(n) (mod k) for all n >= 0 and all positive odd integers k.
Hence for each odd k, the sequence obtained by taking a(n) modulo k is a periodic sequence and the exact period divides k. For example, taking a(n) modulo 7 gives the purely periodic sequence [1, 1, 2, 4, 3, 5, 6, 1, 1, 2, 4, 3, 5, 6, 1, 1, 2, 4, 3, 5, 6, ...] of period 7. For similar results see A047974 and A115329. (End)

A004016 Theta series of planar hexagonal lattice A_2.

Original entry on oeis.org

1, 6, 0, 6, 6, 0, 0, 12, 0, 6, 0, 0, 6, 12, 0, 0, 6, 0, 0, 12, 0, 12, 0, 0, 0, 6, 0, 6, 12, 0, 0, 12, 0, 0, 0, 0, 6, 12, 0, 12, 0, 0, 0, 12, 0, 0, 0, 0, 6, 18, 0, 0, 12, 0, 0, 0, 0, 12, 0, 0, 0, 12, 0, 12, 6, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 6, 12, 0, 0, 12, 0

Offset: 0

N. J. A. Sloane

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
a(n) is the number of integer solutions to x^2 + x*y + y^2 = n (or equivalently x^2 - x*y + y^2 = n). - Michael Somos, Sep 20 2004
a(n) is the number of integer solutions to x^2 + y^2 + z^2 = 2*n where x + y + z = 0. - Michael Somos, Mar 12 2012
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Cubic AGM theta functions: a(q) (the present sequence), b(q) (A005928), c(q) (A005882).
a(n) = 6*A002324(n) if n>0, and A002324 is multiplicative, thus a(1)*a(m*n) = a(n)*a(m) if n>0, m>0 are relatively prime. - Michael Somos, Mar 17 2019
The first occurrence of a(n)= 6, 12, 18, 24, ... (multiples of 6) is at n= 1, 7, 49, 91, 2401, 637, 117649, ... (see A002324). - R. J. Mathar, Sep 21 2024

			G.f. = 1 + 6*x + 6*x^3 + 6*x^4 + 12*x^7 + 6*x^9 + 6*x^12 + 12*x^13 + 6*x^16 + ...
Theta series of A_2 on the standard scale in which the minimal norm is 2:
1 + 6*q^2 + 6*q^6 + 6*q^8 + 12*q^14 + 6*q^18 + 6*q^24 + 12*q^26 + 6*q^32 + 12*q^38 + 12*q^42 + 6*q^50 + 6*q^54 + 12*q^56 + 12*q^62 + 6*q^72 + 12*q^74 + 12*q^78 + 12*q^86 + 6*q^96 + 18*q^98 + 12*q^104 + 12*q^114 + 12*q^122 + 12*q^126 + 6*q^128 + 12*q^134 + 12*q^146 + 6*q^150 + 12*q^152 + 12*q^158 + ...

B. C. Berndt, Ramanujan's Notebooks Part IV, Springer-Verlag, see p. 171, Entry 28.
Harvey Cohn, Advanced Number Theory, Dover Publications, Inc., 1980, p. 89. Ex. 18.
J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 111.
M. N. Huxley, Area, Lattice Points and Exponential Sums, Oxford, 1996; p. 236.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe)
S. Ahlgren, The sixth, eighth, ninth and tenth powers of Ramanujan's theta function, Proc. Amer. Math. Soc., 128 (1999), 1333-1338; F_3(q).
J. M. Borwein and P. B. Borwein, A cubic counterpart of Jacobi's identity and the AGM, Trans. Amer. Math. Soc., 323 (1991), no. 2, 691-701. MR1010408 (91e:33012) see page 695.
G. L. Hall, Comment on the paper "Theta series and magic numbers for diamond and certain ionic crystal structures" [J. Math. Phys. 28, 1653 (1987)]. Journal of Mathematical Physics; Sep. 1988, Vol. 29 Issue 9, pp. 2090-2092. - From _N. J. A. Sloane_, Dec 18 2012
M. D. Hirschhorn, Three classical results on representations of a number, Séminaire Lotharingien de Combinatoire, B42f (1999), 8 pp.
Christian Kassel and Christophe Reutenauer, The zeta function of the Hilbert scheme of n points on a two-dimensional torus, arXiv:1505.07229v3 [math.AG], 2015. [Note that a later version of this paper has a different title and different contents, and the number-theoretical part of the paper was moved to the publication which is next in this list.]
Christian Kassel and Christophe Reutenauer, Complete determination of the zeta function of the Hilbert scheme of n points on a two-dimensional torus, arXiv:1610.07793 [math.NT], 2016.
Masao Koike, Modular forms on non-compact arithmetic triangle groups, Unpublished manuscript [Extensively annotated with OEIS A-numbers by N. J. A. Sloane, Feb 14 2021. I wrote 2005 on the first page but the internal evidence suggests 1997.]
G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2.
Helmut Ruhland, A family of lattices with an unbounded number of unit vectors, arXiv:2410.16172 [math.MG], 2024. See p. 2.
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references).
N. J. A. Sloane, Tables of Sphere Packings and Spherical Codes, IEEE Trans. Information Theory, vol. IT-27, 1981 pp. 327-338.
N. J. A. Sloane, Theta series and magic numbers for diamond and certain ionic crystal structures, J. Math. Phys. 28 (1987), 1653-1657.
Michael Somos, Introduction to Ramanujan theta functions.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions.
Index entries for sequences related to A2 = hexagonal = triangular lattice.

Cf. A002324, A003051, A003215, A005881, A005882, A005928, A008458, A033685, A033687, A038587-A038591, etc.
See also A035019.
Cf. A000007, A000122, A004015, A008444, A008445, A008446, A008447, A008448, A008449 (Theta series of lattices A_0, A_1, A_3, A_4, ...), A186706.

Basis( ModularForms( Gamma1(3), 1), 81) [1]; /* Michael Somos, May 27 2014 */

L := Lattice("A",2); A := ThetaSeries(L, 161); A; /* Michael Somos, Nov 13 2014 */

A004016 := proc(n)
    local a,j ;
    a := A033716(n) ;
    for j from 0 to n/3 do
        a := a+A089800(n-1-3*j)*A089800(j) ;
    end do:
    a;
end proc:
seq(A004016(n),n=0..49) ; # R. J. Mathar, Feb 22 2021

a[ n_] := If[ n < 1, Boole[ n == 0 ], 6 DivisorSum[ n, KroneckerSymbol[ #, 3] &]]; (* Michael Somos, Nov 08 2011 *)
a[ n_] := SeriesCoefficient[ (QPochhammer[ q]^3 + 9 q QPochhammer[ q^9]^3) / QPochhammer[ q^3], {q, 0, n}]; (* Michael Somos, Nov 13 2014 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q] EllipticTheta[ 3, 0, q^3] + EllipticTheta[ 2, 0, q] EllipticTheta[ 2, 0, q^3], {q, 0, n}]; (* Michael Somos, Nov 13 2014 *)
a[ n_] := Length @ FindInstance[ x^2 + x y + y^2 == n, {x, y}, Integers, 10^9]; (* Michael Somos, Sep 14 2015 *)
terms = 81; f[q_] = LatticeData["A2", "ThetaSeriesFunction"][-I Log[q]/Pi]; s = Series[f[q], {q, 0, 2 terms}]; CoefficientList[s, q^2][[1 ;; terms]] (* Jean-François Alcover, Jul 04 2017 *)

{a(n) = my(A, p, e); if( n<1, n==0, A = factor(n); 6 * prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==3, 1, p%3==1, e+1, 1-e%2)))}; /* Michael Somos, May 20 2005 */ /* Editor's note: this is the most efficient program */

{a(n) = if( n<0, 0, polcoeff( 1 + 6 * sum( k=1,n, x^k / (1 + x^k + x^(2*k)), x * O(x^n)), n))}; /* Michael Somos, Oct 06 2003 */

{a(n) = if( n<1, n==0, 6 * sumdiv( n,d, kronecker( d, 3)))}; /* Michael Somos, Mar 16 2005 */

{a(n) = if( n<1, n==0, 6 * sumdiv( n,d, (d%3==1) - (d%3==2)))}; /* Michael Somos, May 20 2005 */

{a(n) = my(A); if( n<0, 0, n*=3; A = x * O(x^n); polcoeff( (eta(x + A)^3  + 3 * x * eta(x^9 + A)^3) / eta(x^3 + A), n))}; /* Michael Somos, May 20 2005 */

{a(n) = if( n<1, n==0, qfrep([ 2, 1; 1, 2], n, 1)[n] * 2)}; /* Michael Somos, Jul 16 2005 */

{a(n) = if( n<0, 0, polcoeff( 1 + 6 * sum( k=1, n, x^(3*k - 2) / (1 - x^(3*k - 2)) - x^(3*k - 1) / (1 - x^(3*k - 1)), x * O(x^n)), n))} /* Paul D. Hanna, Jul 03 2011 */

from math import prod
from sympy import factorint
def A004016(n): return 6*prod(e+1 if p%3==1 else int(not e&1) for p, e in factorint(n).items() if p != 3) if n else 1 # Chai Wah Wu, Nov 17 2022

ModularForms( Gamma1(3), 1, prec=81).0 ; # Michael Somos, Jun 04 2013

Expansion of a(q) in powers of q where a(q) is the first cubic AGM theta function.
Expansion of theta_3(q) * theta_3(q^3) + theta_2(q) * theta_2(q^3) in powers of q.
Expansion of phi(x) * phi(x^3) + 4 * x * psi(x^2) * psi(x^6) in powers of x where phi(), psi() are Ramanujan theta functions.
Expansion of (1 / Pi) integral_{0 .. Pi/2} theta_3(z, q)^3 + theta_4(z, q)^3 dz in powers of q^2. - Michael Somos, Jan 01 2012
Expansion of coefficient of x^0 in f(x * q, q / x)^3 in powers of q^2 where f(,) is Ramanujan's general theta function. - Michael Somos, Jan 01 2012
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2 - 3*v^2 - 2*u*w + 4*w^2. - Michael Somos, Jun 11 2004
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = (u1-u3) * (u3-u6) - (u2-u6)^2. - Michael Somos, May 20 2005
G.f. is a period 1 Fourier series which satisfies f(-1 / (3 t)) = 3^(1/2) (t/i) f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 11 2007
G.f. A(x) satisfies A(x) + A(-x) = 2 * A(x^4), from Ramanujan.
G.f.: 1 + 6 * Sum_{k>0} x^k / (1 + x^k + x^(2*k)). - Michael Somos, Oct 06 2003
G.f.: Sum_( q^(n^2+n*m+m^2) ) where the sum (for n and m) extends over the integers. - Joerg Arndt, Jul 20 2011
G.f.: theta_3(q) * theta_3(q^3) + theta_2(q) * theta_2(q^3) = (eta(q^(1/3))^3 + 3 * eta(q^3)^3) / eta(q).
G.f.: 1 + 6*Sum_{n>=1} x^(3*n-2)/(1-x^(3*n-2)) - x^(3*n-1)/(1-x^(3*n-1)). - Paul D. Hanna, Jul 03 2011
a(3*n + 2) = 0, a(3*n) = a(n), a(3*n + 1) = 6 * A033687(n). - Michael Somos, Jul 16 2005
a(2*n + 1) = 6 * A033762(n), a(4*n + 2) = 0, a(4*n) = a(n), a(4*n + 1) = 6 * A112604(n), a(4*n + 3) = 6 * A112595(n). - Michael Somos, May 17 2013
a(n) = 6 * A002324(n) if n>0. a(n) = A005928(3*n).
Euler transform of A192733. - Michael Somos, Mar 12 2012
a(n) = (-1)^n * A180318(n). - Michael Somos, Sep 14 2015
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*Pi/sqrt(3) = 3.627598... (A186706). - Amiram Eldar, Oct 15 2022

A005882 Theta series of planar hexagonal lattice (A2) with respect to deep hole.

Original entry on oeis.org

3, 3, 6, 0, 6, 3, 6, 0, 3, 6, 6, 0, 6, 0, 6, 0, 9, 6, 0, 0, 6, 3, 6, 0, 6, 6, 6, 0, 0, 0, 12, 0, 6, 3, 6, 0, 6, 6, 0, 0, 3, 6, 6, 0, 12, 0, 6, 0, 0, 6, 6, 0, 6, 0, 6, 0, 9, 6, 6, 0, 6, 0, 0, 0, 6, 9, 6, 0, 0, 6, 6, 0, 12, 0, 6, 0, 6, 0, 0, 0, 6, 6, 12, 0, 0, 3, 12, 0, 0, 6, 6, 0, 6, 0, 6, 0, 3, 6, 0, 0, 12

Offset: 0

N. J. A. Sloane

nonn

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
On page 111 of Conway and Sloane is "If the origin is moved to a deep hole the theta series is Theta_{hex+[1]}(z) = theta_2(z) psi_6(3z) + theta_3(z) psi_3(3z) = 3 q^{1/3} + 3 q^{4/3} + 6 q^{7/3} + 6 q^{13/3} + ... (63)" where the psi_k() for integer k is defined on page 103 equation (11) as psi_k(z) = e^{Pi i/z^2} theta_3(Pi z/k | z) = Sum_{m in Z} q^{(m + 1/k)^2}. - Michael Somos, Sep 10 2018

			G.f. = 3 + 3*x + 6*x^2 + 6*x^4 + 3*x^5 + 6*x^6 + 3*x^8 + 6*x^9 + 6*x^10 + ...
G.f. = 3*q + 3*q^4 + 6*q^7 + 6*q^13 + 3*q^16 + 6*q^19 + 3*q^25 + 6*q^28 + ...

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 111.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe)
J. M. Borwein and P. B. Borwein, A cubic counterpart of Jacobi's identity and the AGM, Trans. Amer. Math. Soc., 323 (1991), no. 2, 691-701. MR1010408 (91e:33012) see page 695.
Christian Kassel and Christophe Reutenauer, The zeta function of the Hilbert scheme of n points on a two-dimensional torus, arXiv:1505.07229v3 [math.AG], 2015. [Note that a later version of this paper has a different title and different contents, and the number-theoretical part of the paper was moved to the publication which is next in this list.]
Christian Kassel and Christophe Reutenauer, Complete determination of the zeta function of the Hilbert scheme of n points on a two-dimensional torus, arXiv:1610.07793 [math.NT], 2016.
G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2
N. J. A. Sloane and B. K. Teo, Theta series and magic numbers for close-packed spherical clusters, J. Chem. Phys. 83 (1985) 6520-6534.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Essentially same as A033685 and A033687.

Cf. A113062, A273845.

Basis( ModularForms( Gamma1(9), 1), 302)[2] * 3; /* Michael Somos, Jul 19 2014 */

a[ n_] := SeriesCoefficient[ 3 QPochhammer[ q^3]^3 / QPochhammer[ q], {q, 0, n}]; (* Michael Somos, Jul 19 2014 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( 3 * eta(x^3 + A)^3 / eta(x + A), n))}; /* Michael Somos, Aug 15 2006 */

Expansion of q^(-1/3) * 3 * eta(q^3)^3 / eta(q) in powers of q.
Expansion of q^(-1/3) * c(q) in powers of q where c(q) is the third cubic AGM theta function.
Given g.f. A(x), then B(x) = x*A(x^3) satisfies 0 = f(B(x), B(x^2), B(x^4)) where f(u, v, w) = v^3 + 2*u*w^2 - u^2*w. - Michael Somos, Aug 15 2006
G.f.: 3 Product_{k>0} (1-q^(3k))^3/(1-q^k).
G.f.: Sum_{u,v in Z} x^(u*u + u*v + v*v + u + v). - Michael Somos, Jul 19 2014
a(n) = 3 * A033687(n). a(n) = A113062(3*n + 1) = A033685(3*n + 1).
Expansion of 2 * psi(x^2) * f(x^2, x^4) + phi(x) * f(x^1, x^5) in powers of x where phi(), psi() are Ramanujan theta functions and f(, ) is Ramanujan's general theta function. - Michael Somos, Sep 07 2018
Sum_{k=1..n} a(k) ~ 2*Pi*n/sqrt(3). - Vaclav Kotesovec, Dec 17 2022

A027193 Number of partitions of n into an odd number of parts.

Original entry on oeis.org

0, 1, 1, 2, 2, 4, 5, 8, 10, 16, 20, 29, 37, 52, 66, 90, 113, 151, 190, 248, 310, 400, 497, 632, 782, 985, 1212, 1512, 1851, 2291, 2793, 3431, 4163, 5084, 6142, 7456, 8972, 10836, 12989, 15613, 18646, 22316, 26561, 31659, 37556, 44601, 52743, 62416, 73593, 86809, 102064, 120025, 140736

Offset: 0

Clark Kimberling

nonn

Number of partitions of n in which greatest part is odd.
Number of partitions of n+1 into an even number of parts, the least being 1. Example: a(5)=4 because we have [5,1], [3,1,1,1], [2,1,1] and [1,1,1,1,1,1].
Also number of partitions of n+1 such that the largest part is even and occurs only once. Example: a(5)=4 because we have [6], [4,2], [4,1,1] and [2,1,1,1,1]. - Emeric Deutsch, Apr 05 2006
Also the number of partitions of n such that the number of odd parts and the number of even parts have opposite parities.  Example: a(8)=10 is a count of these partitions: 8, 611, 521, 431, 422, 41111, 332, 32111, 22211, 2111111. - Clark Kimberling, Feb 01 2014, corrected Jan 06 2021
In Chaves 2011 see page 38 equation (3.20). - Michael Somos, Dec 28 2014
Suppose that c(0) = 1, that c(1), c(2), ... are indeterminates, that d(0) = 1, and that d(n) = -c(n) - c(n-1)*d(1) - ... - c(0)*d(n-1).  When d(n) is expanded as a polynomial in c(1), c(2),..,c(n), the terms are of the form H*c(i_1)*c(i_2)*...*c(i_k).  Let P(n) = [c(i_1), c(i_2), ..., c(i_k)], a partition of n.  Then H is negative if P has an odd number of parts, and H is positive if P has an even number of parts.  That is, d(n) has A027193(n) negative coefficients, A027187(n) positive coefficients, and A000041 terms.  The maximal coefficient in d(n), in absolute value, is A102462(n). - Clark Kimberling, Dec 15 2016

			G.f. = x + x^2 + 2*x^3 + 2*x^4 + 4*x^5 + 5*x^6 + 8*x^7 + 10*x^8 + 16*x^9 + 20*x^10 + ...
From _Gus Wiseman_, Feb 11 2021: (Start)
The a(1) = 1 through a(8) = 10 partitions into an odd number of parts are the following. The Heinz numbers of these partitions are given by A026424.
  (1)  (2)  (3)    (4)    (5)      (6)      (7)        (8)
            (111)  (211)  (221)    (222)    (322)      (332)
                          (311)    (321)    (331)      (422)
                          (11111)  (411)    (421)      (431)
                                   (21111)  (511)      (521)
                                            (22111)    (611)
                                            (31111)    (22211)
                                            (1111111)  (32111)
                                                       (41111)
                                                       (2111111)
The a(1) = 1 through a(8) = 10 partitions whose greatest part is odd are the following. The Heinz numbers of these partitions are given by A244991.
  (1)  (11)  (3)    (31)    (5)      (33)      (7)        (53)
             (111)  (1111)  (32)     (51)      (52)       (71)
                            (311)    (321)     (322)      (332)
                            (11111)  (3111)    (331)      (521)
                                     (111111)  (511)      (3221)
                                               (3211)     (3311)
                                               (31111)    (5111)
                                               (1111111)  (32111)
                                                          (311111)
                                                          (11111111)
(End)

N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 39, Example 7.

T. D. Noe, Table of n, a(n) for n = 0..999
Roland Bacher and P. De La Harpe, Conjugacy growth series of some infinitely generated groups, hal-01285685v2, 2016.
D. R. C. Chaves, Um estudo combinatório e comparativo de identidades teta parciais de Andrews e Ramanujan, 2011. In Portuguese.
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, function p_0(n).

Cf. A000041, A000700, A000701, A026837, A046682.
The Heinz numbers of these partitions are A026424 or A244991.
The even-length version is A027187.
The case of odd sum as well as length is A160786, ranked by A340931.
The case of odd maximum as well as length is A340385.
Other cases of odd length:
- A024429 counts set partitions of odd length.
- A067659 counts strict partitions of odd length.
- A089677 counts ordered set partitions of odd length.
- A166444 counts compositions of odd length.
- A174726 counts ordered factorizations of odd length.
- A332304 counts strict compositions of odd length.
- A339890 counts factorizations of odd length.
A000009 counts partitions into odd parts, ranked by A066208.
A026804 counts partitions whose least part is odd.
A058695 counts partitions of odd numbers, ranked by A300063.
A072233 counts partitions by sum and length.
A101707 counts partitions of odd positive rank.
Cf. A078408, A174725, A236914, A300272, A340831.

g:=sum(x^(2*k)/product(1-x^j,j=1..2*k-1),k=1..40): gser:=series(g,x=0,50): seq(coeff(gser,x,n),n=1..45); # Emeric Deutsch, Apr 05 2006

nn=40;CoefficientList[Series[ Sum[x^(2j+1)Product[1/(1- x^i),{i,1,2j+1}],{j,0,nn}],{x,0,nn}],x]  (* Geoffrey Critzer, Dec 01 2012 *)
a[ n_] := If[ n < 0, 0, Length@Select[ IntegerPartitions[ n], OddQ[ Length@#] &]]; (* Michael Somos, Dec 28 2014 *)
a[ n_] := If[ n < 1, 0, Length@Select[ IntegerPartitions[ n], OddQ[ First@#] &]]; (* Michael Somos, Dec 28 2014 *)
a[ n_] := If[ n < 0, 0, Length@Select[ IntegerPartitions[ n + 1], #[[-1]] == 1 && EvenQ[ Length@#] &]]; (* Michael Somos, Dec 28 2014 *)
a[ n_] := If[ n < 1, 0, Length@Select[ IntegerPartitions[ n + 1], EvenQ[ First@#] && (Length[#] < 2 || #[[1]] != #[[2]]) &]]; (* Michael Somos, Dec 28 2014 *)

{a(n) = if( n<1, 0, polcoeff( sum( k=1, n, if( k%2, x^k / prod( j=1, k, 1 - x^j, 1 + x * O(x^(n-k)) ))), n))}; /* Michael Somos, Jul 24 2012 */

q='q+O('q^66); concat([0], Vec( (1/eta(q)-eta(q)/eta(q^2))/2 ) ) \\ Joerg Arndt, Mar 23 2014

a(n) = (A000041(n) - (-1)^n*A000700(n)) / 2.
For g.f. see under A027187.
G.f.: Sum(k>=1, x^(2*k-1)/Product(j=1..2*k-1, 1-x^j ) ). - Emeric Deutsch, Apr 05 2006
G.f.: - Sum(k>=1, (-x)^(k^2)) / Product(k>=1, 1-x^k ). - Joerg Arndt, Feb 02 2014
G.f.: Sum(k>=1, x^(k*(2*k-1)) / Product(j=1..2*k, 1-x^j)). - Michael Somos, Dec 28 2014
a(2*n) = A000701(2*n), a(2*n-1) = A046682(2*n-1); a(n) = A000041(n)-A027187(n). - Reinhard Zumkeller, Apr 22 2006

A004009 Expansion of Eisenstein series E_4(q) (alternate convention E_2(q)); theta series of E_8 lattice.

Original entry on oeis.org

1, 240, 2160, 6720, 17520, 30240, 60480, 82560, 140400, 181680, 272160, 319680, 490560, 527520, 743040, 846720, 1123440, 1179360, 1635120, 1646400, 2207520, 2311680, 2877120, 2920320, 3931200, 3780240, 4747680, 4905600, 6026880

Offset: 0

N. J. A. Sloane

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
E_8 is also the Barnes-Wall lattice in 8 dimensions.
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).
Ramanujan Lambert series: P(q) (see A006352), Q(q) (A004009), R(q) (A013973).
The E_8 lattice is integral, unimodular, and even. The 240 shortest nonzero vectors in the lattice have norm squared 2. Of these vectors, 128 are all half-integer, and 112 are all integer. - Michael Somos, Jun 10 2019

			G.f. = 1 + 240*x + 2160*x^2 + 6720*x^3 + 17520*x^4 + 30240*x^5 + 60480*x^6 + ...
G.f. = 1 + 240*q^2 + 2160*q^4 + 6720*q^6 + 17520*q^8 + 30240*q^10 + 60480*q^12 + ...

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 123.
W. Ebeling, Lattices and Codes, Vieweg; 2nd ed., 2002, see p. 53.
R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.
S. Ramanujan, On Certain Arithmetical Functions, Messenger Math., 45 (1916), 11-15 (Eq. (25)). Collected Papers of Srinivasa Ramanujan, Chap. 16, Ed. G. H. Hardy et al., Chelsea, NY, 1962.
S. Ramanujan, On Certain Arithmetical Functions, Messenger Math., 45 (1916), 11-15 (Eq. (25)). Ramanujan's Papers, p. 196, Ed. B. J. Venkatachala et al., Prism Books, Bangalore 2000.
Jean-Pierre Serre, "A Course in Arithmetic", Springer, 1978
Joseph H. Silverman, "Advanced Topics in the Arithmetic of Elliptic Curves", Springer, 1994
N. J. A. Sloane, Seven Staggering Sequences, in Homage to a Pied Puzzler, E. Pegg Jr., A. H. Schoen and T. Rodgers (editors), A. K. Peters, Wellesley, MA, 2009, pp. 93-110.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from N. J. A. Sloane)
D. Bump, Automorphic Forms and Representations, Cambr. Univ. Press, 1997, p. 29.
H. H. Chan and C. Krattenthaler, Recent progress in the study of representations of integers as sums of squares, arXiv:math/0407061 [math.NT], 2004.
Heng Huat Chan, Shaun Cooper, and Pee Choon Toh, Ramanujan's Eisenstein series and powers of Dedekind's eta-function, Journal of the London Mathematical Society 75.1 (2007): 225-242. See Q(q).
Henry Cohn and Stephen D. Miller, Some properties of optimal functions for sphere packing in dimensions 8 and 24, arXiv:1603.04759 [math.MG], 2016.
H. S. M. Coxeter, Integral Cayley numbers, Duke Math. J. 13 (1946), 561-578; reprinted in "Twelve Geometric Essays", pp. 20-39.
D. de Laat and F. Vallentin, A Breakthrough in Sphere Packing: The Search for Magic Functions, arXiv preprint arXiv:1607.02111 [math.MG], 2016.
Yang-Hui He and John McKay, Sporadic and Exceptional, arXiv:1505.06742 [math.AG], 2015.
N. Heninger, E. M. Rains and N. J. A. Sloane, On the Integrality of n-th Roots of Generating Functions, arXiv:math/0509316 [math.NT], 2005-2006; J. Combinatorial Theory, Series A, 113 (2006), 1732-1745.
M. Kaneko and D. Zagier, Supersingular j-invariants, hypergeometric series and Atkin's orthogonal polynomials, pp. 97-126 of D. A. Buell and J. T. Teitelbaum, eds., Computational Perspectives on Number Theory, Amer. Math. Soc., 1998
Masao Koike, Modular forms on non-compact arithmetic triangle groups, Unpublished manuscript [Extensively annotated with OEIS A-numbers by N. J. A. Sloane, Feb 14 2021. I wrote 2005 on the first page but the internal evidence suggests 1997.]
Robert V. Moody and Jiri Patera, Fast recursion formula for weight multiplicities, Bulletin of the American Mathematical Society 7.1 (1982): 237-242.
G. Nebe and N. J. A. Sloane, Home page for E_8 lattice
H. Ochiai, Counting functions for branched covers of elliptic curves and quasi-modular forms, arXiv:math-ph/9909023, 1999.
S. Ramanujan, On the coefficients in the expansions of certain modular functions, Proc. Royal Soc., A, 95 (1918), 144-155.
Michael Somos, Introduction to Ramanujan theta functions
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
N. J. A. Sloane, Seven Staggering Sequences.
Maryna S. Viazovska, The sphere packing problem in dimension 8, arXiv preprint arXiv:1603.04246 [math.NT], 2016.
Martin H. Weissman, Octonions, Cubes, Embeddings, March 2, 2009.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
Eric Weisstein's World of Mathematics, Eisenstein Series.
Eric Weisstein's World of Mathematics, Leech Lattice.
Eric Weisstein's World of Mathematics, Barnes-Wall Lattice
Wikipedia, Eisenstein series
Wikipedia, E_8 lattice
Index entries for sequences related to Eisenstein series
Index entries for sequences related to Barnes-Wall lattices

Cf. A046948 (partial sums), A000143, A108091 (eighth root).
Cf. A008410, A008411, A001158.
Cf. A006352 (E_2), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).
Cf. A007331 (theta_2(q)^8 / 256), A000143 (theta_3(q)^8), A035016 (theta_4(q)^8).

Basis( ModularForms( Gamma1(1), 4), 29) [1]; /* Michael Somos, May 11 2015 */

L := Lattice("E",8); A := ThetaSeries(L, 57); A; /* Michael Somos, Jun 10 2019 */

with(numtheory); E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(4);

a[ n_] := If[ n < 1, Boole[n == 0], 240 DivisorSigma[ 3, n]]; (* Michael Somos, Jul 11 2011 *)
a[ n_] := SeriesCoefficient[ With[ {t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^2 + 14 t2 t3 + t3^2], {q, 0, n}]; (* Michael Somos, Jun 04 2014 *)
max = 30; s = 1 + 240*Sum[k^3*(q^k/(1 - q^k)), {k, 1, max}] + O[q]^max; CoefficientList[s, q] (* Jean-François Alcover, Nov 27 2015, after Gene Ward Smith *)
a[ n_] := SeriesCoefficient[ With[ {t2 = EllipticTheta[ 2, 0, q]^4, t3 = EllipticTheta[ 3, 0, q]^4}, t2^2 - t2 t3 + t3^2], {q, 0, 2 n}]; (* Michael Somos, Jul 31 2016 *)

{a(n) = if( n<1, n==0, 240 * sigma(n, 3))};

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x + A)^24 + 256 * x * eta(x^2 + A)^24) / (eta(x + A) * eta(x^2 + A))^8, n))}; /* Michael Somos, Dec 30 2008 */

q='q+O('q^50); Vec((eta(q)^24+256*q*eta(q^2)^24)/(eta(q)*eta(q^2))^8) \\ Altug Alkan, Sep 30 2018

from sympy import divisor_sigma
def a(n): return 1 if n == 0 else 240 * divisor_sigma(n, 3)
[a(n) for n in range(51)]  # Indranil Ghosh, Jul 15 2017

ModularForms(Gamma1(1), 4, prec=30).0 ; # Michael Somos, Jun 04 2013

Can also be expressed as E4(q) = 1 + 240*Sum_{i >= 1} i^3 q^i/(1 - q^i) - Gene Ward Smith, Aug 22 2006
Theta series of E_8 lattice = 1 + 240 * Sum_{m >= 1} sigma_3(m) * q^(2*m), where sigma_3(m) is the sum of the cubes of the divisors of m (A001158).
Expansion of (phi(-q)^8 - (2 * phi(-q) * phi(q))^4 + 16 * phi(q)^8) in powers of q where phi() is a Ramanujan theta function.
Expansion of (eta(q)^24 + 256 * eta(q^2)^24) / (eta(q) * eta(q^2))^8 in powers of q. - Michael Somos, Dec 30 2008
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2 + 33*v^2 + 256*w^2 - 18*u*v + 16*u*w - 288*v*w . - Michael Somos, Jan 05 2006
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u1^2 + 16*u2^2 + 81*u3^2 + 1296*u6^2 - 14*u1*u2 - 18*u1*u3 + 30*u1*u6 + 30*u2*u3 - 288*u2*u6 - 1134*u3*u6 . - Michael Somos, Apr 15 2007
G.f. A(x) satisfies 0 = f(A(x), A(x^3), A(x^9)) where f(u, v, w) = u^3*v + 9*w*u^3 - 84*u^2*v^2 + 246*u*v^3 - 253*v^4 - 675*w*u^2*v + 729*w^2*u^2 - 4590*w*u*v^2 + 19926*w*v^3 - 54675*w^2*u*v + 59049*w^3*u + 531441*w^3*v - 551124*w^2*v^2 . - Michael Somos, Apr 15 2007
G.f. is a period 1 Fourier series which satisfies f(-1 / t) = (t/i)^4 * f(t) where q = exp(2 Pi i t). - Michael Somos, Dec 30 2008
Convolution square is A008410. A008411 is convolution of this sequence with A008410.
Expansion of Ramanujan's function Q(q^2) = 12 (omega/Pi)^4 g2 (Weierstrass invariant) in powers of q^2.
Expansion of a(q) * (a(q)^3 + 8*c(q)^3) in powers of q where a(), c() are cubic AGM theta functions. - Michael Somos, Jan 14 2015
G.f. is (theta_2(q)^8 + theta_3(q)^8 + theta_4(q)^8) / 2 where q = exp(Pi i t). So a(n) = A008430(n) + 128*A007331(n) (= A000143(2*n) + 128*A007331(n) = A035016(2*n) + 128*A007331(n)). - Seiichi Manyama, Sep 30 2018
a(n) = 240*A001158(n) if n>0. - Michael Somos, Oct 01 2018
Sum_{k=1..n} a(k) ~ 2 * Pi^4 * n^4 / 3. - Vaclav Kotesovec, Jan 14 2024

A015128 Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.

Original entry on oeis.org

1, 2, 4, 8, 14, 24, 40, 64, 100, 154, 232, 344, 504, 728, 1040, 1472, 2062, 2864, 3948, 5400, 7336, 9904, 13288, 17728, 23528, 31066, 40824, 53408, 69568, 90248, 116624, 150144, 192612, 246256, 313808, 398640, 504886, 637592, 802936, 1008448

Offset: 0

N. J. A. Sloane

The over-partition function.
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Also the number of jagged partitions of n.
According to Ramanujan (1913) a(n) is close to (cosh(x)-sinh(x)/x)/(4*n) where x=Pi*sqrt(n). - Michael Somos, Mar 17 2003
Number of partitions of 2n with all odd parts occurring with even multiplicities. There is no restriction on the even parts. Cf. A006950, A046682. - Mamuka Jibladze, Sep 05 2003
Number of partitions of n where there are two kinds of odd parts. - Joerg Arndt, Jul 30 2011. Or, in Gosper's words, partitions into red integers and blue odd integers. - N. J. A. Sloane, Jul 04 2016.
Coincides with the sequence of numbers of nilpotent conjugacy classes in the Lie algebras sp(n), n=0,1,2,3,... (the case n=0 being degenerate). A006950, this sequence and A000041 together cover the nilpotent conjugacy classes in the classical A,B,C,D series of Lie algebras. - Alexander Elashvili, Sep 08 2003
Also, number of 01-partitions of n. A 01-partition of n is a weakly decreasing sequence of m nonnegative integers n(i) such that sum(n(i))=n, n(m)>0, n(j)>=n(j+1)-1 and n(j)>=n(j+2). They are special cases of jagged partitions.
a(8n+7) is divisible by 64 (from Fortin/Jacob/Mathieu paper).
Smallest sequence of even numbers (except a(0)) which is the Euler transform of a sequence of positive integers. - Franklin T. Adams-Watters, Oct 16 2006
Convolution of A000041 and A000009. - Vladeta Jovovic, Nov 26 2002
Equals A022567 convolved with A035363. - Gary W. Adamson, Jun 09 2009
Equals the infinite product [1,2,2,2,...] * [1,0,2,0,2,0,2,...] * [1,0,0,2,0,0,2,0,0,2,...] * ... . - Gary W. Adamson, Jul 05 2009
Equals A182818 convolved with A010815. - Gary W. Adamson, Jul 20 2012
Partial sums of A211971. - Omar E. Pol, Jan 09 2014
Also 1 together with the row sums of A235790. - Omar E. Pol, Jan 19 2014
Antidiagonal sums of A284592. - Peter Bala, Mar 30 2017
The overlining method is equivalent to enumerating the k-subsets of the distinct parts of the i-th partition. - Richard Joseph Boland, Sep 02 2021

			G.f. = 1 + 2*q + 4*q^2 + 8*q^3 + 14*q^4 + 24*q^5 + 40*q^6 + 64*q^7 + 100*q^8 + ...
For n = 4 the 14 overpartitions of 4 are [4], [4'], [2, 2], [2', 2], [3, 1], [3', 1], [3, 1'], [3', 1'], [2, 1, 1], [2', 1, 1], [2, 1', 1], [2', 1', 1], [1, 1, 1, 1], [1', 1, 1, 1]. - _Omar E. Pol_, Jan 19 2014

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 103.
R. W. Gosper, Experiments and discoveries in q-trigonometry, in Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics. Editors: F. G. Garvan and M. E. H. Ismail. Kluwer, Dordrecht, Netherlands, 2001, pp. 79-105. See the function g(q).
James R. Newman, The World of Mathematics, Simon and Schuster, 1956, Vol. I p. 372.

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (first 1000 terms from T. D. Noe)
Gert Almkvist, Asymptotic formulas and generalized Dedekind sums, Exper. Math., 7 (No. 4, 1998), pp. 343-359.
Brennan Benfield and Arindam Roy, Log-concavity And The Multiplicative Properties of Restricted Partition Functions, arXiv:2404.03153 [math.NT], 2024.
Noureddine Chair, Partition identities from Partial Supersymmetry, arXiv:hep-th/0409011, 2004.
Shi-Chao Chen, On the number of overpartitions into odd parts, Discrete Math. 325 (2014), 32--37. MR3181230.
William Y.C. Chen and Ernest X.W. Xia, Proof of a conjecture of Hirschhorn and Sellers on overpartitions, arXiv:1307.4155 [math.CO], 2013; Acta Arith. 163 (2014), no. 1, 59--69. MR3194057
Sylvie Corteel, Particle seas and basic hypergeometric series, Advances Appl. Math., 31 (2003), 199-214.
Sylvie Corteel and Jeremy Lovejoy, Frobenius partitions and the combinatorics of Ramanujan's 1 psi 1 summation, J. Combin. Theory A 97 (2002), 177-183.
Sylvie Corteel and Jeremy Lovejoy, Overpartitions, Trans. Amer. Math. Soc., 356 (2004), 1623-1635.
Brian Drake, Limits of areas under lattice paths, Discrete Math. 309 (2009), no. 12, 3936-3953.
Benjamin Engel, Log-concavity of the overpartition function, The Ramanujan Journal, Vol. 43, No. 2 (2017), pp. 229-241; arXiv preprint, arXiv:1412.4603 [math.NT], 2014.
Alex Fink, Richard K. Guy and Mark Krusemeyer, Partitions with parts occurring at most thrice, Contributions to Discrete Mathematics, Vol 3, No 2 (2008).
J.-F. Fortin, P. Jacob and P. Mathieu, Jagged partitions, The Ramanujan Journal, Vol. 10, No. 2 (2005), pp. 215-235; arXiv preprint, arXiv:math/0310079 [math.CO], 2003-2005.
Frank Garvan, Table of a(n) for n = 1..10000.
R. W. Gosper, Experiments and discoveries in q-trigonometry, in F. G. Garvan and M. E. H. Ismail (eds.), Symbolic computation, number theory, special functions, physics and combinatorics, Springer, Boston, MA, 2001, pp. 79-105; preprint.
R. W. Gosper, q-Trigonometry: Some Prefatory Afterthoughts
William J. Keith, Restricted k-color partitions, The Ramanujan Journal, Vol. 40, No. 1 (2016), pp. 71-92; arXiv preprint, arXiv:1408.4089 [math.CO], 2014.
Byungchan Kim, A short note on the overpartition function, Discr. Math., 309 (2009), 2528-2532.
Byungchan Kim, Overpartition pairs modulo powers of 2, Discrete Math., 311 (2011), 835-840.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], 2015-2016.
Jeremy Lovejoy, Gordon's theorem for overpartitions, J. Combin. Theory A 103 (2003), 393-401.
Karl Mahlburg, The overpartition function modulo small powers of 2, Discr. Math., 286 (2004), 263-267.
Mircea Merca, Overpartitions in terms of 2-adic valuation, Aequat. Math. (2024). See p. 9.
Igor Pak, Partition bijections, a survey, The Ramanujan Journal, Vol. 12, No. 1 (2006), pp. 5-75; alternative link.
Maxie D. Schmidt, Exact Formulas for the Generalized Sum-of-Divisors Functions, arXiv:1705.03488 [math.NT], 2017-2019. See Example 4.1, p. 13.
Michael Somos, Introduction to Ramanujan theta functions
Liuquan Wang, Another Proof of a Conjecture by Hirschhorn and Sellers on Overpartitions, J. Int. Seq. 17 (2014) # 14.9.8.
Eric Weisstein's World of Mathematics, Modular Equation.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions.
Michael P. Zaletel and Roger S. K. Mong, Exact matrix product states for quantum Hall wave functions, Physical Review B, Vol. 86, No. 24 (2012), 245305; arXiv preprint, arXiv:1208.4862 [cond-mat.str-el], 2012. - From _N. J. A. Sloane_, Dec 25 2012

Cf. A022567, A035363, A002448, A106507, A156616, A261386, A265835, A014968, A284592, A303662.
See A004402 for a version with signs.
Column k=2 of A321884.
Cf. A002513.

# JacobiTheta4 is defined in A002448.
A015128List(len) = JacobiTheta4(len, -1)
A015128List(40) |> println # Peter Luschny, Mar 12 2018

mul((1+x^n)/(1-x^n),n=1..256): seq(coeff(series(%,x,n+1),x,n), n=0..40);
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      b(n, i-1) +2*add(b(n-i*j, i-1), j=1..n/i)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..40);  # Alois P. Heinz, Feb 10 2014
a_list := proc(len) series(1/JacobiTheta4(0,x),x,len+1); seq(coeff(%,x,j),j=0..len) end: a_list(39); # Peter Luschny, Mar 14 2017

max = 39; f[x_] := Exp[Sum[(DivisorSigma[1, 2*n] - DivisorSigma[1, n])*(x^n/n), {n, 1, max}]]; CoefficientList[ Series[f[x], {x, 0, max}], x] (* Jean-François Alcover, Jun 11 2012, after Joerg Arndt *)
a[ n_] := SeriesCoefficient[ QHypergeometricPFQ[ {-1}, {}, x, x], {x, 0, n}]; (* Michael Somos, Mar 11 2014 *)
QP = QPochhammer; s = QP[q^2]/QP[q]^2 + O[q]^40; CoefficientList[s + O[q]^100, q] (* Jean-François Alcover, Nov 25 2015, after Michael Somos *)
Table[Sum[PartitionsP[n-k]*PartitionsQ[k], {k, 0, n}], {n, 0, 50}] (* Vaclav Kotesovec, Nov 28 2015 *)
(QPochhammer[-x, x]/QPochhammer[x, x] + O[x]^50)[[3]] (* Vladimir Reshetnikov, Nov 12 2016 *)
nmax = 100; p = ConstantArray[0, nmax+1]; p[[1]] = 1; Do[p[[n+1]] = 0; k = 1; While[n + 1 - k^2 > 0, p[[n+1]] += (-1)^(k+1)*p[[n + 1 - k^2]]; k++;]; p[[n+1]] = 2*p[[n+1]];, {n, 1, nmax}]; p (* Vaclav Kotesovec, Apr 11 2017 *)
a[ n_] := SeriesCoefficient[ 1 / EllipticTheta[ 4, 0, x], {x, 0, n}]; (* Michael Somos, Nov 15 2018 *)
a[n_] := Sum[2^Length[Union[IntegerPartitions[n][[i]]]], {i, 1, PartitionsP[n]}]; (* Richard Joseph Boland, Sep 02 2021 *)
n = 39; CoefficientList[Product[(1 + x^k)/(1 - x^k), {k, 1, n}] + O[x]^(n + 1), x] (* Oliver Seipel, Sep 19 2021 *)

{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, Nov 01 2008 */

{a(n)=polcoeff(exp(sum(m=1,n\2+1,2*x^(2*m-1)/(1-x^(2*m-1)+x*O(x^n))/(2*m-1))),n)} /* Paul D. Hanna, Aug 06 2009 */

N=66; x='x+O('x^N); gf=exp(sum(n=1,N,(sigma(2*n)-sigma(n))*x^n/n));Vec(gf) /* Joerg Arndt, Jul 30 2011 */

lista(nn) = {q='q+O('q^nn); Vec(eta(q^2)/eta(q)^2)} \\ Altug Alkan, Mar 20 2018

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

Euler transform of period 2 sequence [2, 1, ...]. - Michael Somos, Mar 17 2003
G.f.: Product_{m>=1} (1 + q^m)/(1 - q^m).
G.f.: 1 / (Sum_{m=-inf..inf} (-q)^(m^2)) = 1/theta_4(q).
G.f.: 1 / Product_{m>=1} (1 - q^(2*m)) * (1 - q^(2*m-1))^2.
G.f.: exp( Sum_{n>=1} 2*x^(2*n-1)/(1 - x^(2*n-1))/(2*n-1) ). - Paul D. Hanna, Aug 06 2009
G.f.: exp( Sum_{n>=1} (sigma(2*n) - sigma(n))*x^n/n ). - Joerg Arndt, Jul 30 2011
G.f.: Product_{n>=0} theta_3(q^(2^n))^(2^n). - Joerg Arndt, Aug 03 2011
A004402(n) = (-1)^n * a(n). - Michael Somos, Mar 17 2003
Expansion of eta(q^2) / eta(q)^2 in powers of q. - Michael Somos, Nov 01 2008
Expansion of 1 / phi(-q) in powers of q where phi() is a Ramanujan theta function. - Michael Somos, Nov 01 2008
Convolution inverse of A002448. - Michael Somos, Nov 01 2008
Recurrence: a(n) = 2*Sum_{m>=1} (-1)^(m+1) * a(n-m^2).
a(n) = (1/n)*Sum_{k=1..n} (sigma(2*k) - sigma(k))*a(n-k). - Vladeta Jovovic, Dec 05 2004
G.f.: Product_{i>=1} (1 + x^i)^A001511(2i) (see A000041). - Jon Perry, Jun 06 2004
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = w^4 * (u^4 + v^4) - 2 * u^2 * v^6. - Michael Somos, Nov 01 2008
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u6^3 * (u1^2 + u3^2) - 2 * u1 * u2 * u3^3. - Michael Somos, Nov 01 2008
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u2^3 * (u3^2 - 3 * u1^2) + 2 * u1^3 * u3 * u6. - Michael Somos, Nov 01 2008
G.f. is a period 1 Fourier series which satisfies f(-1 / (16 t)) = 32^(-1/2) (t/i)^(-1/2) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A106507. - Michael Somos, Nov 01 2008
a(n) = 2*A014968(n), n >= 1. - Omar E. Pol, Jan 19 2014
a(n) ~ Pi * BesselI(3/2, Pi*sqrt(n)) / (4*sqrt(2)*n^(3/4)). - Vaclav Kotesovec, Jan 11 2017
Let T(n,k) = the number of partitions of n with parts 1 through k of two kinds, T(n,0) = A000041(n), the number of partitions of n. Then a(n) = T(n,0) + T(n-1,1) + T(n-3,2) + T(n-6,3) + T(n-10,4) + T(n-15,5) + ... .   Gregory L. Simay, May 29 2019
For n >= 1, a(n) = Sum_{k>=1} 2^k * A116608(n,k). - Gregory L. Simay, Jun 01 2019
Sum_{n>=1} 1/a(n) = A303662. - Amiram Eldar, Nov 15 2020
a(n) = Sum_{i=1..p(n)} 2^(d(n,i)), where d(n,i) is the number of distinct parts in the i-th partition of n. - Richard Joseph Boland, Sep 02 2021
G.f.: A(x) = exp( Sum_{n >= 1} x^n*(2 + x^n)/(n*(1 - x^(2*n))) ). - Peter Bala, Dec 23 2021
G.f. A(q) satisfies (3*A(q)/A(q^9) - 1)^3 = 9*A(q)^4/A(q^3)^4 - 1. - Paul D. Hanna, Oct 14 2024

Minor edits by Vaclav Kotesovec, Sep 13 2014

A027187 Number of partitions of n into an even number of parts.

Original entry on oeis.org

1, 0, 1, 1, 3, 3, 6, 7, 12, 14, 22, 27, 40, 49, 69, 86, 118, 146, 195, 242, 317, 392, 505, 623, 793, 973, 1224, 1498, 1867, 2274, 2811, 3411, 4186, 5059, 6168, 7427, 9005, 10801, 13026, 15572, 18692, 22267, 26613, 31602, 37619, 44533, 52815, 62338, 73680, 86716, 102162, 119918

Offset: 0

Clark Kimberling

nonn

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
For n > 0, also the number of partitions of n whose greatest part is even. [Edited by Gus Wiseman, Jan 05 2021]
Number of partitions of n+1 into an odd number of parts, the least being 1.
Also the number of partitions of n such that the number of even parts has the same parity as the number of odd parts; see Comments at A027193. - Clark Kimberling, Feb 01 2014, corrected Jan 06 2021
Suppose that c(0) = 1, that c(1), c(2), ... are indeterminates, that d(0) = 1, and that d(n) = -c(n) - c(n-1)*d(1) - ... - c(0)*d(n-1).  When d(n) is expanded as a polynomial in c(1), c(2),..,c(n), the terms are of the form H*c(i_1)*c(i_2)*...*c(i_k).  Let P(n) = [c(i_1), c(i_2), ..., c(i_k)], a partition of n.  Then H is negative if P has an odd number of parts, and H is positive if P has an even number of parts.  That is, d(n) has A027193(n) negative coefficients, A027187(n) positive coefficients, and A000041 terms.  The maximal coefficient in d(n), in absolute value, is A102462(n). - Clark Kimberling, Dec 15 2016

			G.f. = 1 + x^2 + x^3 + 3*x^4 + 3*x^5 + 6*x^6 + 7*x^7 + 12*x^8 + 14*x^9 + 22*x^10 + ...
From _Gus Wiseman_, Jan 05 2021: (Start)
The a(2) = 1 through a(8) = 12 partitions into an even number of parts are the following. The Heinz numbers of these partitions are given by A028260.
  (11)  (21)  (22)    (32)    (33)      (43)      (44)
              (31)    (41)    (42)      (52)      (53)
              (1111)  (2111)  (51)      (61)      (62)
                              (2211)    (2221)    (71)
                              (3111)    (3211)    (2222)
                              (111111)  (4111)    (3221)
                                        (211111)  (3311)
                                                  (4211)
                                                  (5111)
                                                  (221111)
                                                  (311111)
                                                  (11111111)
The a(2) = 1 through a(8) = 12 partitions whose greatest part is even are the following. The Heinz numbers of these partitions are given by A244990.
  (2)  (21)  (4)    (41)    (6)      (43)      (8)
             (22)   (221)   (42)     (61)      (44)
             (211)  (2111)  (222)    (421)     (62)
                            (411)    (2221)    (422)
                            (2211)   (4111)    (431)
                            (21111)  (22111)   (611)
                                     (211111)  (2222)
                                               (4211)
                                               (22211)
                                               (41111)
                                               (221111)
                                               (2111111)
(End)

N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; See p. 8, (7.323) and p. 39, Example 7.

Alois P. Heinz, Table of n, a(n) for n = 0..10000 (first 1000 terms from T. D. Noe)
George E. Andrews and David Newman, The Minimal Excludant in Integer Partitions, J. Int. Seq., Vol. 23 (2020), Article 20.2.3.
Arvind Ayyer, Hiranya Kishore Dey, and Digjoy Paul, How large is the character degree sum compared to the character table sum for a finite group?, arXiv:2406.06036 [math.RT], 2024. See p. 13.
Roland Bacher and Pierre De La Harpe, Conjugacy growth series of some infinitely generated groups, International Mathematics Research Notices, 2016, pp.1-53. (hal-01285685v2)
N. J. Fine, Problem 4314, Amer. Math. Monthly, Vol. 57, 1950, 421-423.
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, function p_e(n).
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A000701, A046682, A026838, A102462.
The Heinz numbers of these partitions are A028260.
The odd version is A027193.
The strict case is A067661.
The case of even sum as well as length is A236913 (the even bisection).
Other cases of even length:
- A024430 counts set partitions of even length.
- A034008 counts compositions of even length.
- A052841 counts ordered set partitions of even length.
- A174725 counts ordered factorizations of even length.
- A332305 counts strict compositions of even length
- A339846 counts factorizations of even length.
A000009 counts partitions into odd parts, ranked by A066208.
A026805 counts partitions whose least part is even.
A072233 counts partitions by sum and length.
A101708 counts partitions of even positive rank.
Cf. A000700, A026424, A058696, A096373, A244990, A300061.

f[n_] := Length[Select[IntegerPartitions[n], IntegerQ[First[#]/2] &]]; Table[f[n], {n, 1, 30}] (* Clark Kimberling, Mar 13 2012 *)
a[ n_] := SeriesCoefficient[ (1 + EllipticTheta[ 4, 0, x]) / (2 QPochhammer[ x]), {x, 0, n}]; (* Michael Somos, May 06 2015 *)
a[ n_] := If[ n < 0, 0, Length@Select[ IntegerPartitions[n], EvenQ[Length @ #] &]]; (* Michael Somos, May 06 2015 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( sum( k=0, sqrtint(n), (-x)^k^2, A) / eta(x + A), n))}; /* Michael Somos, Aug 19 2006 */

my(q='q+O('q^66)); Vec( (1/eta(q)+eta(q)/eta(q^2))/2 ) \\ Joerg Arndt, Mar 23 2014

a(n) = (A000041(n) + (-1)^n * A000700(n))/2.
a(n) = p(n) - p(n-1) + p(n-4) - p(n-9) + ... where p(n) is the number of unrestricted partitions of n, A000041. [Fine] - David Callan, Mar 14 2004
From Bill Gosper, Jun 25 2005: (Start)
G.f.: A(q) = Sum_{n >= 0} a(n) q^n = 1 + q^2 + q^3 + 3*q^4 + 3*q^5 + 6*q^6 + ...
  = Sum_{n >= 0} q^(2*n)/(q; q)_{2*n}
  = ((Product_{k >= 1} 1/(1-q^k)) + (Product_{k >= 1} 1/(1+q^k)))/2.
Also, let B(q) = Sum_{n >= 0} A027193(n) q^n = q + q^2 + 2*q^3 + 2*q^4 + 4*q^5 + 5*q^6 + ...
Then B(q) = Sum_{n >= 0} q^(2*n+1)/(q; q){2*n+1} = ((Product{k >= 1} 1/(1-q^k)) - (Product_{k >= 1} 1/(1+q^k)))/2.
Also we have the following identity involving 2 X 2 matrices:
Product_{k >= 1} [ 1/(1-q^(2*k)), q^k/(1-q^(2*k)) ; q^k/(1-q^(2*k)), 1/(1-q^(2*k)) ]
  = [ A(q), B(q) ; B(q), A(q) ]. (End)
a(2*n) = A046682(2*n), a(2*n+1) = A000701(2*n+1); a(n) = A000041(n)-A027193(n). - Reinhard Zumkeller, Apr 22 2006
Expansion of (1 + phi(-q)) / (2 * f(-q)) where phi(), f() are Ramanujan theta functions. - Michael Somos, Aug 19 2006
G.f.: (Sum_{k>=0} (-1)^k * x^(k^2)) / (Product_{k>0} (1 - x^k)). - Michael Somos, Aug 19 2006
a(n) = A338914(n) + A096373(n). - Gus Wiseman, Jan 06 2021

Offset changed to 0 by Michael Somos, Jul 24 2012

A047993 Number of balanced partitions of n: the largest part equals the number of parts.

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 3, 2, 4, 4, 6, 7, 11, 11, 16, 19, 25, 29, 40, 45, 60, 70, 89, 105, 134, 156, 196, 232, 285, 336, 414, 485, 591, 696, 839, 987, 1187, 1389, 1661, 1946, 2311, 2702, 3201, 3731, 4400, 5126, 6018, 6997, 8195, 9502, 11093, 12849, 14949, 17281, 20062

Offset: 1

Wouter Meeussen

Useful in the creation of plane partitions with C3 or C3v symmetry.
The function T[m,a,b] used here gives the partitions of m whose Ferrers plot fits within an a X b box.
Central terms of triangle in A063995: a(n) = A063995(n,0). - Reinhard Zumkeller, Jul 24 2013
Sequence enumerates the collection of partitions of size n that are in the monoid of Dyson rank=0, or balanced partitions, under the binary operation A*B = (a1,a2,...,a[k-1],k)*(b1,...,b[n-1,n) = (a1*b1,...,a1*n,a2*b1,...,a2*n,...,k*b1,...,k*n), where A is a partition with k parts and B is a partition with n parts, and A*B is a partition with k*n parts. Note that the rank of A*B is 0, as required. For example, the product of the rank 0 partitions (1,2,3) of 6 and (1,1,3) of 5 is the rank 0 partition (1,1,2,2,3,3,3,6,9) of 30. There is no rank zero partition of 2, as shown in the sequence. It can be seen that any element of the monoid that partitions an odd prime p or a composite number of form 2p cannot be a product of smaller nontrivial partitions, whether in this monoid or not. - Richard Locke Peterson, Jul 15 2018
The "multiplication" given above was noted earlier by Franklin T. Adams-Watters in A122697. - Richard Peterson, Jul 19 2023
The Heinz numbers of these integer partitions are given by A106529. - Gus Wiseman, Mar 09 2019

			From _Joerg Arndt_, Oct 08 2012: (Start)
a(12) = 7 because the partitions of 12 where the largest part equals the number of parts are
   2 + 3 + 3 + 4,
   2 + 2 + 4 + 4,
   1 + 3 + 4 + 4,
   1 + 2 + 2 + 2 + 5,
   1 + 1 + 2 + 3 + 5,
   1 + 1 + 1 + 4 + 5, and
   1 + 1 + 1 + 1 + 2 + 6.
(End)
From _Gus Wiseman_, Mar 09 2019: (Start)
The a(1) = 1 through a(13) = 11 integer partitions:
  1  21  22  311  321  322   332   333    4222   4322    4332    4333
                       331   4211  4221   4321   4331    4422    4432
                       4111        4311   4411   4421    4431    4441
                                   51111  52111  52211   52221   52222
                                                 53111   53211   53221
                                                 611111  54111   53311
                                                         621111  54211
                                                                 55111
                                                                 622111
                                                                 631111
                                                                 7111111
(End)

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
Erich Friedman, Illustration of initial terms

Cf. A000700, A063995, A064173, A064174.
Cf. A003114, A006141, A039900, A090858, A106529, A324516, A324518, A324520.
Column 1 of A350879.

a047993 = flip a063995 0  -- Reinhard Zumkeller, Jul 24 2013

A047993 := proc(n)
     a := 0 ;
     for p in combinat[partition](n) do
        r := max(op(p))-nops(p) ;
        if r = 0 then
             a := a+1 ;
        end if;
     end do:
     a ;
 end proc:
seq(A047993(n),n=1..20) ; # Emeric Deutsch, Dec 11 2004

Table[ Count[Partitions[n], par_List/; First[par]===Length[par]], {n, 12}] or recur: Sum[T[n-(2m-1), m-1, m-1], {m, Ceiling[Sqrt[n]], Floor[(n+1)/2]}] with T[m_, a_, b_]/; b < a := T[m, b, a]; T[m_, a_, b_]/; m > a*b := 0; T[m_, a_, b_]/; (2m > a*b) := T[a*b-m, a, b]; T[m_, 1, b_] := If[b < m, 0, 1]; T[0, , ] := 1; T[m_, a_, b_] := T[m, a, b]=Sum[T[m-a*i, a-1, b-i], {i, 0, Floor[m/a]}];
Table[Sum[ -(-1)^k*(p[n-(3*k^2-k)/2] - p[n-(3*k^2+k)/2]), {k, 1, Floor[(1+Sqrt[1+24*n])/6]}] /. p -> PartitionsP, {n, 1, 64}] (* Wouter Meeussen *)
(* also *)
Table[Count[IntegerPartitions[n], q_ /; Max[q] == Length[q]], {n, 24}]
(* Clark Kimberling, Feb 13 2014 *)
nmax = 100; p = 1; s = 1; Do[p = Normal[Series[p*x^2*(1 - x^(2*k - 1))*(1 + x^k)/(1 - x^k), {x, 0, nmax}]]; s += p;, {k, 1, nmax + 1}]; Take[CoefficientList[s, x], nmax] (* Vaclav Kotesovec, Oct 16 2024 *)

N=66;  q='q + O('q^N );
S=2+2*ceil(sqrt(N));
gf= sum(k=1, S,  (-1)^k * ( q^((3*k^2+k)/2) - q^((3*k^2-k)/2) ) ) / prod(k=1,N, 1-q^k );
/* Joerg Arndt, Oct 08 2012 */

my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, x^(2*k-1)*prod(j=1, k-1, (1-x^(k+j-1))/(1-x^j)))) \\ Seiichi Manyama, Jan 24 2022

a(n) = p(n-1) - p(n-2) - p(n-5) + p(n-7) + ... + (-1)^k*(p(n-(3*k^2-k)/2) - p(n-(3*k^2+k)/2)) + ..., where p() is A000041(). E.g., a(20) = p(19) - p(18) - p(15) + p(13) + p(8) - p(5) = 490 - 385 - 176 + 101 + 22 - 7 = 45. - Vladeta Jovovic, Aug 04 2004
G.f.: ( Sum_{k>=1} (-1)^k * ( x^((3*k^2+k)/2) - x^((3*k^2-k)/2) ) ) / Product_{k>=1} (1-x^k). - Vladeta Jovovic, Aug 05 2004
a(n) ~ exp(Pi*sqrt(2*n/3))*Pi / (48*sqrt(2)*n^(3/2)) ~ p(n) * Pi / (4*sqrt(6*n)), where p(n) is the partition function A000041. - Vaclav Kotesovec, Oct 06 2016
G.f.: Sum_{n>=0} [2n,n]q q^(2*n), where [m,n]_q are the q-binomial coefficients. - _Mamuka Jibladze, Aug 12 2021
G.f.: Sum_{k>=1} x^(2*k-1) * Product_{j=1..k-1} (1-x^(k+j-1))/(1-x^j). - Seiichi Manyama, Jan 24 2022

cp's OEIS Frontend

A121373 Expansion of f(x) = f(x, -x^2) in powers of x where f(, ) is Ramanujan's general theta function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A008284 Triangle of partition numbers: T(n,k) = number of partitions of n in which the greatest part is k, 1 <= k <= n. Also number of partitions of n into k positive parts, 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Python

Sage

Formula

A000085 Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Maxima

Maxima

PARI

PARI

Python

Sage

Sage

Formula

A004016 Theta series of planar hexagonal lattice A_2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

PARI

PARI

PARI

Python

Sage

Formula

A005882 Theta series of planar hexagonal lattice (A2) with respect to deep hole.

Views

Author