A003106 -id:A003106 - cp's OEIS frontend

A007325 G.f.: Product_{k>0} (1-x^(5k-1))(1-x^(5k-4))/((1-x^(5k-2))(1-x^(5k-3))).

1, -1, 1, 0, -1, 1, -1, 1, 0, -1, 2, -3, 2, 0, -2, 4, -4, 3, -1, -3, 6, -7, 5, 0, -5, 9, -10, 7, -1, -7, 14, -16, 11, -1, -11, 20, -22, 16, -2, -15, 29, -33, 23, -2, -23, 41, -45, 32, -4, -30, 57, -64, 45, -4, -43, 78, -86, 60, -7, -57, 107, -119, 83, -8, -79, 143

Offset: 0

N. J. A. Sloane, Mira Bernstein

Expansion of f(-x, -x^4) / f(-x^2, -x^3) in powers of x where f(,) is Ramanujan's two-variable theta function.
Hauptmodul series for Gamma(5).
Expansion of Rogers-Ramanujan's continued fraction 1 / (1 + x / ( 1 + x^2 / ( 1 + x^3 / ( 1 + x^4 / ... )))).
Given the g.f. A(x) the notation R(q) := q^(1/5) * A(q) is used by Berndt.

			G.f. = 1 - x + x^2 - x^4 + x^5 - x^6 + x^7 - x^9 + 2*x^10 - 3*x^11 + 2*x^12 - ...
G.f. = q - q^6 + q^11 - q^21 + q^26 - q^31 + q^36 - q^46 + 2*q^51 - 3*q^56 + ...

G. E. Andrews and B. C. Berndt, Ramanujan's Lost Notebook, Part I, Springer, 2005, see p. 57.
B. C. Berndt, Ramanujan's Notebooks Part V, Springer-Verlag, see p. 9.
J. M. Borwein and P. B. Borwein, Pi and the AGM, Wiley, 1987, p. 81.
A. Erdelyi, Higher Transcendental Functions, McGraw-Hill, 1955, Vol. 3, p. 24.
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)
G. E. Andrews, Simplicity and surprise in Ramanujan's "Lost" Notebook, Amer. Math. Monthly, 104 (No. 10, Dec. 1997), 918-925.
W. Duke, Continued fractions and modular functions, Bull. Amer. Math. Soc. 42 (2005), 137-162; see Eq. (6.4).
G. S. Joyce, Exact results for the activity and thermal compressibility of the hard-hexagon model, J. Phys. A 21 (1988), L983-L988.
J. Malenfant, Generalizing Ramanujan's J Functions, arXiv preprint arXiv:1109.5957 [math.NT], 2011.
P. J. Nahin, Number-Crunching, Princeton University Press, 2011. See p. 22 equation (2.2.4).
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
Eric Weisstein's World of Mathematics, Rogers-Ramanujan Continued Fraction.

Cf. A055101, A055102, A055103, A003823, A167683.

t1:=mul((1-x^(5*k-1))*(1-x^(5*k-4))/((1-x^(5*k-2))*(1-x^(5*k-3))), k=1..60); seriestolist(series(t1,x,59)); # N. J. A. Sloane, Jun 10 2013
A007325_G:=proc(x,NK);Digits:=250;
Q2:=1;
for k from NK by -1 to 0 do
Q1:=1+x^k/Q2; Q2:=Q1; od;
Q3:=Q2; S:=Q3-1;
end;
# Sergei N. Gladkovskii, Dec 18 2011

a[ n_] := SeriesCoefficient[ QPochhammer[ q, q^5] QPochhammer[ q^4, q^5] / (QPochhammer[ q^2, q^5] QPochhammer[ q^3, q^5]), {q, 0, n}]; (* Michael Somos, Aug 17 2011 *)
a[ n_] := SeriesCoefficient[ ContinuedFractionK[ q^k, 1, {k, 0, n}], {q, 0, n}]; (* Michael Somos, Jun 10 2013 *)
max = 65; CoefficientList[ Series[ Fold[ #2/(1 + #1)&, q^n, q^Reverse[ Range[0, max-1] ] ], {q, 0, max}], q] (* Jean-François Alcover, Apr 04 2013 *)

{a(n) = my(k); if( n<0, 0, k = (3 + sqrtint(9 + 40*n)) \ 10; polcoeff( sum( n=-k, k, (-1)^n * x^((5*n^2 + 3*n)/2), x * O(x^n)) / sum( n=-k, k,( -1)^n * x^((5*n^2 + n)/2), x * O(x^n)), n))};

{a(n) = if( n<0, 0, polcoeff( prod( k=1, n, if(k%5, (1 - x^k)^((-1)^binomial( k%5, 2)), 1), 1 + x * O(x^n)), n))};

{a(n) = my(cf); if( n<0, 0, cf = contfracpnqn( matrix( 2, (sqrtint(8*n + 1) + 1)\2, i, j, if( i==1, x^(j-1), 1))); polcoeff( cf[2, 1] / cf[1, 1] + x * O(x^n), n))};

{a(n) = my(A, m); if( n<0, 0, m=1; A = 1 + O(x); while( m<=n, m*=5; A = x * subst(A, x, x^5); A = (A * (1 - 2*A + 4*A^2 - 3*A^3 + A^4) / (1 + 3*A + 4*A^2 + 2*A^3 + A^4) / x)^(1/5)); polcoeff(A, n))};

Euler transform of period 5 sequence [-1, 1, 1, -1, 0, ...] (=-A080891).
G.f.: Product_{k>=1}(1-x^(5*k-1)) * (1-x^(5*k-4)) / ( (1-x^(5*k-2)) * (1-x^(5*k-3)) ) = H(x) / G(x) where H and G are respectively the g.f. of A003114 and A003106.
G.f.: (Sum (-1)^k x^((5*k + 3)*k/2))/(Sum (-1)^k x^((5*k + 1)*k/2)). - Michael Somos, Dec 13 2002
Given g.f. A(x), then B(q) = q * A(q^5) satisfies 0 = f(B(q), B(q^2)) where f(u, v) = u^2 - v + u*v^3 + u^3*v^2. - Michael Somos, Mar 09 2004
Given g.f. A(x), then B(q) = q * A(q^5) satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u * (u*v + w^2 + v^2*w) - w. - Michael Somos, Aug 29 2005
Given g.f. A(x), then B(q) = q * A(q^5) satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1*u2 + u1*u3^2*u6 + u2*u3^2 - u2^2*u3*u6 - u3. - Michael Somos, Aug 29 2005
G.f.: 1 / (1 + x / ( 1 + x^2 / ( 1 + x^3 / ( 1 + x^4 / ... )))).
G.f.: 1 / (1 + 1 / (x^-1 + 1 / (x^-1 + 1 / (x^-2 + 1 / (x^-2 + 1 / ... ))))). - Michael Somos, Apr 30 2012
G.f.: A(x) =  S(0) -1; S(k) = 1 + x^k/S(k+1); (continued fraction). - Sergei N. Gladkovskii, Dec 18 2011
Hankel transform is A167683. - Michael Somos, Apr 30 2012
a(n) = (-1)^n * A226556(n). - Michael Somos, Jun 11 2013
a(0) = 1, a(n) = -(1/n)*Sum_{k=1..n} A109091(k)*a(n-k) for n > 0. - Seiichi Manyama, Apr 01 2017

A047221 Numbers that are congruent to {2, 3} mod 5.

Original entry on oeis.org

2, 3, 7, 8, 12, 13, 17, 18, 22, 23, 27, 28, 32, 33, 37, 38, 42, 43, 47, 48, 52, 53, 57, 58, 62, 63, 67, 68, 72, 73, 77, 78, 82, 83, 87, 88, 92, 93, 97, 98, 102, 103, 107, 108, 112, 113, 117, 118, 122, 123, 127, 128, 132, 133, 137, 138, 142, 143, 147, 148, 152, 153

Offset: 1

N. J. A. Sloane

Theorem: if 5^((n-1)/2) = -1 (mod n) then n == 2 or 3 (mod 5) (see Crandall and Pomerance).
Start with 2. The next number, 3, cannot be written as the sum of two of the previous terms. So 3 is in. 4=2+2, 5=2+3, 6=3+3, so these are not in. But you cannot obtain 7, so the next term is 7. And so on. - Fabian Rothelius, Mar 13 2001
Also numbers k such that k^2 == -1 (mod 5). - Vincenzo Librandi, Aug 05 2010
For any (t,s) < n, a(t)*a(s) != a(n) and a(t) - a(s) != a(n). - Anders Hellström, Jul 01 2015
These numbers appear in the product of a Rogers-Ramanujan identity. See A003106 also for references. - Wolfdieter Lang, Oct 29 2016

Richard Crandall and Carl Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see Exercise 3.24, p. 154.

N. J. A. Sloane, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A118015 (floor(n^2/5)).
Cf. A003631 (primes), A094214.
Partitions into: A003106, A219607.

a047221 n = 5 * ((n - 1) `div` 2) + 3 - n `mod` 2
a047221_list = 2 : 3 : map (+ 5) a047221_list
-- Reinhard Zumkeller, Nov 27 2012

[ n : n in [1..165] | n mod 5 eq 2 or n mod 5 eq 3 ];

{2,3}+#&/@(5 Range[0,30])//Flatten (* Harvey P. Dale, Jan 22 2023 *)

Vec(x*(2+x+2*x^2)/((1+x)*(1-x)^2) + O(x^80)) \\ Michel Marcus, Jun 30 2015

a(n) = 5*(n-1) - a(n-1) (with a(1)=2). - Vincenzo Librandi, Aug 05 2010
a(n) = (10*n - 3*(-1)^n - 5)/4.
G.f.: x*(2+x+2*x^2)/((1+x)*(1-x)^2).
a(n)^2 = 5*A118015(a(n)) + 4.
a(n) = 5 * (floor(n-1)/2) + 3 - n mod 2. - Reinhard Zumkeller, Nov 27 2012
Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(1-2/sqrt(5))*Pi/5. - Amiram Eldar, Dec 07 2021
E.g.f.: 2 + ((5*x - 5/2)*exp(x) - (3/2)*exp(-x))/2. - David Lovler, Aug 23 2022
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = 1.
Product_{n>=1} (1 + (-1)^n/a(n)) = 1/phi (A094214). (End)

More terms from Larry Reeves (larryr(AT)acm.org), Apr 08 2002

Closed formula, g.f. and link added by Bruno Berselli, Nov 28 2010

A039900 Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5).

Original entry on oeis.org

0, 1, 1, 2, 4, 6, 9, 13, 19, 27, 38, 52, 71, 95, 127, 167, 220, 285, 370, 474, 607, 770, 976, 1226, 1540, 1920, 2391, 2960, 3660, 4501, 5529, 6760, 8254, 10038, 12190, 14750, 17825, 21470, 25825, 30975, 37101, 44322, 52879, 62937, 74811, 88733, 105110, 124261

Offset: 0

Olivier Gérard

nonn

For a given partition cn(i,n) means the number of its parts equal to i modulo n.
Short: o < 0 + 1 + 4 (OMZAAp).
Number of partitions of n such that (greatest part) >= (multiplicity of greatest part), for n >= 1.  For example, a(6) counts these 9 partitions:  6, 51, 42, 411, 33, 321, 3111, 22111, 21111.  See the Mathematica program at A240057 for the sequence as a count of these partitions, along with counts of related partitions.  - Clark Kimberling, Apr 02 2014
The Heinz numbers of these integer partitions are given by A324561. - Gus Wiseman, Mar 09 2019
From Gus Wiseman, Mar 09 2019: (Start)
Also the number of integer partitions of n whose minimum part is less than or equal to the number of parts. The Heinz numbers of these integer partitions are given by A324560. For example, the a(1) = 1 through a(7) = 13 integer partitions are:
  (1)  (11)  (21)   (22)    (32)     (42)      (52)
             (111)  (31)    (41)     (51)      (61)
                    (211)   (221)    (222)     (322)
                    (1111)  (311)    (321)     (331)
                            (2111)   (411)     (421)
                            (11111)  (2211)    (511)
                                     (3111)    (2221)
                                     (21111)   (3211)
                                     (111111)  (4111)
                                               (22111)
                                               (31111)
                                               (211111)
                                               (1111111)
(End)

			From _Gus Wiseman_, Mar 09 2019: (Start)
The a(1) = 1 through a(7) = 13 integer partitions with at least one part equal to 0, 1, or 4 modulo 5:
  (1)  (11)  (21)   (4)     (5)      (6)       (43)
             (111)  (31)    (41)     (42)      (52)
                    (211)   (221)    (51)      (61)
                    (1111)  (311)    (321)     (331)
                            (2111)   (411)     (421)
                            (11111)  (2211)    (511)
                                     (3111)    (2221)
                                     (21111)   (3211)
                                     (111111)  (4111)
                                               (22111)
                                               (31111)
                                               (211111)
                                               (1111111)
(End)

Alois P. Heinz, Table of n, a(n) for n = 0..10000

Cf. A003106, A003114, A039899.
Cf. A003114, A006141, A047993, A064174, A117144.
Cf. A324518, A324520, A324522, A324560, A324561.

b:= proc(n, i, t) option remember; `if`(n=0, t,
      `if`(i<1, 0, b(n, i-1, t)+ `if`(i>n, 0, b(n-i, i,
      `if`(irem(i, 5) in {2, 3}, t, 1)))))
    end:
a:= n-> b(n$2, 0):
seq(a(n), n=0..50);  # Alois P. Heinz, Apr 03 2014

Table[Count[IntegerPartitions[n], p_ /; Min[p] <= Length[p]], {n, 40}] (* Clark Kimberling, Feb 13 2014 *)
b[n_, i_, t_] := b[n, i, t] = If[n==0, t, If[i<1, 0, b[n, i-1, t] + If[i > n, 0, b[n-i, i, If[MemberQ[{2, 3}, Mod[i, 5]], t, 1]]]]]; a[n_] := b[n, n, 0]; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Nov 16 2015, after Alois P. Heinz *)

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

G.f.: Sum_{k>=0} x^k * (1-x^(k^2)) / Product_{j=1..k} (1-x^j). - Seiichi Manyama, Jan 13 2022

a(n) = A000041(n) - A003106(n). - Vaclav Kotesovec, Oct 20 2024

A122129 Expansion of 1 + Sum_{k>0} x^k^2/((1-x)(1-x^2)...(1-x^(2k))).

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 5, 7, 9, 12, 15, 19, 24, 30, 37, 46, 57, 69, 84, 102, 123, 148, 177, 211, 252, 299, 353, 417, 491, 576, 675, 789, 920, 1071, 1244, 1442, 1670, 1929, 2224, 2562, 2946, 3381, 3876, 4437, 5072, 5791, 6602, 7517, 8551, 9714, 11021, 12493, 14145

Offset: 0

Michael Somos, Aug 21 2006

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.
a(n) = number of SE partitions of n, for n >= 1; see A237981. - Clark Kimberling, Mar 19 2014
In Watson 1937 page 275 he writes "Psi_0(1,q) = prod_1^oo (1+q^{2n}) G(q^8)" so this is the expansion in powers of q^2. - Michael Somos, Jun 28 2015
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Rogers-Ramanujan functions: G(x) (see A003114), H(x) (A003106).
From Gus Wiseman, Feb 19 2022: (Start)
This appears to be the number of integer partitions of n with every other pair of adjacent parts strictly decreasing, as in the pattern a > b >= c > d >= e for a partition (a, b, c, d, e). For example, the a(1) = 1 through a(9) = 12 partitions are:
  (1)  (2)  (3)   (4)    (5)    (6)    (7)    (8)     (9)
            (21)  (31)   (32)   (42)   (43)   (53)    (54)
                  (211)  (41)   (51)   (52)   (62)    (63)
                         (311)  (321)  (61)   (71)    (72)
                                (411)  (322)  (422)   (81)
                                       (421)  (431)   (432)
                                       (511)  (521)   (522)
                                              (611)   (531)
                                              (3221)  (621)
                                                      (711)
                                                      (4221)
                                                      (32211)
The even-length case is A351008. The odd-length case appears to be A122130. Swapping strictly and weakly decreasing relations appears to give A122135. The alternately unequal and equal case is A351006, strict A035457, opposite A351005, even-length A351007. (End)
Wiseman's first conjecture above was proved by Gordon, Theorem 7. For two other combinatorial interpretations of this sequence see Connor, Proposition 1. - Peter Bala, Dec 22 2024

			Clark Kimberling's SE partition comment, n=6: the 5 SE partitions are [1,1,1,1,1,1] from the partitions 6 and 1^6; [1,1,1,2,1] from 5,1 and 2,1^4; [1,1,3,1] from 4,2 and 2^2,1^2; [2,3,1] from 3,2,1 and 3^2 and 2^3; and [1,2,2,1] from 4,1^2 and 3,1^3. - _Wolfdieter Lang_, Mar 20 2014
G.f. = 1 + x + x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 5*x^6 + 7*x^7 + 9*x^8 + ...
G.f. = 1/q + q^39 + q^79 + 2*q^119 + 3*q^159 + 4*q^199 + 5*q^239 + ...

G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.7). MR0858826 (88b:11063)
G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(a), p. 591.

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Willard G. Connor, Partition Theorems Related to Some Identities of Rogers and Watson, Transactions of the American Mathematical Society, Vol. 214 (Dec., 1975), pp. 95-111.
Basil Gordon, Continued fractions of the Rogers-Ramanujan type, Duke Math. J. 32 (1965), 741-748. MR 32 # 1477.
M. D. Hirschhorn, Some partition theorems of the Rogers-Ramanujan type, J. Combin. Theory Ser. A 27 (1979), no. 1, 33--37. MR0541341 (80j:05010). See Theorem 1. [From _N. J. A. Sloane_, Mar 19 2012]
Michael Somos, Introduction to Ramanujan theta functions
George N. Watson, The mock theta functions (2), Proc. London Math. Soc., series 2, 42 (1937) 274-304.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A000009, A000041, A000070, A096441, A122134, A351004.

f:=n->1/mul(1-q^(20*k+n),k=0..20);
f(1)*f(3)*f(4)*f(5)*f(7)*f(9)*f(11)*f(13)*f(15)*f(16)*f(17)*f(19);
series(%,q,200); seriestolist(%); # N. J. A. Sloane, Mar 19 2012.
# second Maple program:
with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1, add(add(d*[0, 1, 0,
       1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1]
      [1+irem(d, 20)], d=divisors(j)) *a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..60);  # Alois P. Heinz, Jul 12 2013

a[0] = 1; a[n_] := a[n] = Sum[Sum[d*{0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1}[[1+Mod[d, 20]]], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n; Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Jan 10 2014, after Alois P. Heinz *)
a[ n_] := If[ n < 0, 0, SeriesCoefficient[ Sum[ x^k^2 / QPochhammer[ x, x, 2 k], {k, 0, Sqrt @ n}], {x, 0, n}]]; (* Michael Somos, Jun 28 2015 *)
a[ n_] := SeriesCoefficient[ 1 / (QPochhammer[ x, x^2] QPochhammer[ x^4, x^20] QPochhammer[ x^16, x^20]), {x, 0, n}]; (* Michael Somos, Jun 28 2015 *)

{a(n) = if( n<0, 0, polcoeff( sum(k=0, sqrtint(n), x^k^2 / prod(i=1, 2*k, 1 - x^i, 1 + x * O(x^(n-k^2)))), n))};

Euler transform of period 20 sequence [ 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, ...].
Expansion of f(-x^2) * f(-x^20) / (f(-x) * f(-x^4,-x^16)) in powers of x where f(,) is the Ramanujan general theta function.
Expansion of f(x^3, x^7) / f(-x, -x^4) in powers of x where f(,) is the Ramanujan general theta function. - Michael Somos, Jun 28 2015
Expansion of f(-x^8, -x^12) / psi(-x) in powers of x where psi() is a Ramanujan theta function. - Michael Somos, Jun 28 2015
Expansion of G(x^4) / chi(-x) in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function. - Michael Somos, Jun 28 2015
G.f.: Sum_{k>=0} x^k^2 / ((1 - x) * (1 - x^2) ... (1 - x^(2*k))).
G.f.: 1 / (Product_{k>0} (1 - x^(2*k-1)) * (1 - x^(20*k-4)) * (1 - x^(20*k-16))).
Let f(n) = 1/Product_{k >= 0} (1 - q^(20k+n)). Then g.f. is f(1)*f(3)*f(4)*f(5)*f(7)*f(9)*f(11)*f(13)*f(15)*f(16)*f(17)*f(19). - N. J. A. Sloane, Mar 19 2012
a(n) is the number of partitions of n into parts that are either odd or == +-4 (mod 20). - Michael Somos, Jun 28 2015
a(n) ~ (3+sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Aug 30 2015

A122134 Expansion of Sum_{k>=0} x^(k^2+k)/((1-x)(1-x^2)...(1-x^(2k))).

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 4, 4, 6, 7, 10, 11, 16, 18, 24, 28, 36, 42, 54, 62, 78, 91, 112, 130, 159, 184, 222, 258, 308, 356, 424, 488, 576, 664, 778, 894, 1044, 1196, 1389, 1590, 1838, 2098, 2419, 2754, 3162, 3596, 4114, 4668, 5328, 6032, 6864, 7760, 8806, 9936, 11252

Offset: 0

Michael Somos, Aug 21 2006, Oct 10 2007

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.
In Watson 1937 page 275 he writes "Psi_0(q^{1/2},q) = prod_1^oo (1+q^{2n}) G(-q^2)" so this is the expansion in powers of q^2. - Michael Somos, Jun 29 2015
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Rogers-Ramanujan functions: G(q) (see A003114), H(q) (A003106).
From Gus Wiseman, Feb 26 2022: (Start)
Conjecture: Also the number of even-length integer partitions y of n such that y_i != y_{i+1} for all even i. For example, the a(2) = 1 through a(9) = 7 partitions are:
  (11)  (21)  (22)  (32)  (33)    (43)    (44)    (54)
              (31)  (41)  (42)    (52)    (53)    (63)
                          (51)    (61)    (62)    (72)
                          (2211)  (3211)  (71)    (81)
                                          (3311)  (3321)
                                          (4211)  (4311)
                                                  (5211)
This appears to be the even-length version of A122135.
The odd-length version is A351595.
Cf. A035363, A035457, A350842, A350844, A351003-A351012, A351593. (End)
For Wiseman's conjecture above and three other partition-theoretic interpretations of this sequence see Connor, Proposition 3. - Peter Bala, Jan 02 2025

			G.f. = 1 + x^2 + x^3 + 2*x^4 + 2*x^5 + 4*x^6 + 4*x^7 + 6*x^8 + 7*x^9 + ...
G.f. = q + q^81 + q^121 + 2*q^161 + 2*q^201 + 4*q^241 + 4*q^281 + ...

G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(c), p. 591.
G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.6). MR0858826 (88b:11063)

G. C. Greubel, Table of n, a(n) for n = 0..1000
Willard G. Connor, Partition Theorems Related to Some Identities of Rogers and Watson, Transactions of the American Mathematical Society, Vol. 214 (Dec., 1975), pp. 95-111.
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.
Mircea Merca, From a Rogers's identity to overpartitions, Periodica Mathematica Hungarica, Vol. 75, issue 2, 172-179, 2017.
Michael Somos, Introduction to Ramanujan theta functions
G. N. Watson, The Mock Theta Functions (2), Proceedings of the London Mathematical Society, s2-42: 274-304, 1937.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A000009, A000041, A053251, A122129, A122130, A122135.

a[ n_] := If[ n < 0, 0, SeriesCoefficient[ Sum[ x^(k^2 + k) / QPochhammer[ x, x, 2 k], {k, 0, (Sqrt[ 4 n + 1] - 1) / 2}], {x, 0, n}]]; (* Michael Somos, Jun 29 2015 *)
a[ n_] := SeriesCoefficient [ 1 / (QPochhammer[ x^4, -x^5] QPochhammer[ -x, -x^5] QPochhammer[ x, x^2]), {x, 0, n}]; (* Michael Somos, Jun 29 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x^2, -x^5] QPochhammer[ -x^3, -x^5] QPochhammer[ -x^5] / EllipticTheta[ 4, 0, x^2], {x, 0, n}]; (* Michael Somos, Jun 29 2015 *)
nmax = 50; CoefficientList[Series[Product[1/((1 - x^(20*k+2))*(1 - x^(20*k+3))*(1 - x^(20*k+4))*(1 - x^(20*k+5))*(1 - x^(20*k+6))*(1 - x^(20*k+7))*(1 - x^(20*k+13))*(1 - x^(20*k+14))*(1 - x^(20*k+15))*(1 - x^(20*k+16))*(1 - x^(20*k+17)) *(1 - x^(20*k+18))), {k, 0, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 12 2016 *)

{a(n) = if( n<0, 0, polcoeff( sum(k=0, (sqrtint(4*n + 1) - 1)\2, x^(k^2 + k) / prod(i=1, 2*k, 1 - x^i, 1 + x * O(x^(n -k^2-k)))), n))};

Euler transform of period 20 sequence [ 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, ...].
Expansion of f(x^4, x^6) / f(-x^2, -x^3) in powers of x where f(, ) is the Ramanujan general theta function. - Michael Somos, Jun 29 2015
Expansion of f(-x^2, x^3) / phi(-x^2) in powers of x where phi() is a Ramanujan theta function. - Michael Somos, Jun 29 2015
Expansion of G(-x) / chi(-x) in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function. - Michael Somos, Jun 29 2015
G.f.: Sum_{k>=0} x^(k^2 + k) / ((1 - x) * (1 - x^2) * ... * (1 - x^(2*k))).
Expansion of f(-x, -x^9) * f(-x^8, -x^12) / ( f(-x) * f(-x^20) ) in powers of x where f(, ) is the Ramanujan general theta function.
a(n) = number of partitions of n into parts that are each either == 2, 3, ..., 7 (mod 20) or == 13, 14, ..., 18 (mod 20). - Michael Somos, Jun 29 2015 [corrected by Vaclav Kotesovec, Nov 12 2016]
a(n) ~ (3 - sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Nov 12 2016

A219607 Number of partitions of n into distinct parts 5k+2 or 5k+3.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 2, 1, 2, 2, 1, 3, 1, 3, 3, 2, 5, 3, 5, 5, 4, 7, 4, 7, 7, 6, 11, 7, 11, 11, 9, 15, 10, 15, 16, 14, 22, 16, 23, 23, 20, 30, 22, 31, 32, 29, 42, 33, 44, 45, 41, 56, 45, 59, 61, 57, 78, 64, 82, 84, 78, 103, 86, 108, 112, 107, 138

Offset: 0

Reinhard Zumkeller, Nov 30 2012

nonn

Convolution of A281271 and A281272. - Vaclav Kotesovec, Jan 18 2017

			a(10) = #{8+2, 7+3} = 2;
a(11) = #{8+3} = 1;
a(12) = #{12, 7+3+2} = 2;
a(13) = #{13, 8+3+2} = 2;
a(14) = #{12+2} = 1;
a(15) = #{13+2, 12+3, 8+7} = 3;
a(16) = #{13+3} = 1;
a(17) = #{17, 12+3+2, 8+7+2} = 3;
a(18) = #{18, 13+3+2, 8+7+3} = 3;
a(19) = #{17+2, 12+7} = 2;
a(20) = #{18+2, 17+3, 13+7, 12+8, 8+7+3+2} = 5.

Seiichi Manyama, Table of n, a(n) for n = 0..1000 (terms 0..250 from Reinhard Zumkeller)

Cf. A047221, A003106, A203776.

a219607 = p a047221_list where
   p _      0 = 1
   p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

nmax = 100; CoefficientList[Series[Product[(1 + x^(5*k - 2))*(1 + x^(5*k - 3)), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jan 18 2017 *)

a(n) ~ exp(sqrt(2*n/15)*Pi) / (2*30^(1/4)*n^(3/4)) * (1 - (3*sqrt(15/2)/(8*Pi) + 11*Pi/(60*sqrt(30))) / sqrt(n)). - Vaclav Kotesovec, Jan 18 2017, extended Jan 24 2017

A333179 G.f.: Sum_{k>=0} (x^(k(k+1)) Product_{j=1..k} (1 + x^j)).

Original entry on oeis.org

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

Offset: 0

Vaclav Kotesovec, Mar 10 2020

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000

Cf. A003106, A053261, A306734.

nmax = 100; CoefficientList[Series[Sum[x^(n*(n+1))*Product[1+x^k, {k, 1, n}], {n, 0, Sqrt[nmax]}], {x, 0, nmax}], x]
nmax = 100; p = 1; s = 1; Do[p = Expand[p*(1 + x^k)*x^(2*k)]; p = Take[p, Min[nmax + 1, Exponent[p, x] + 1, Length[p]]]; s += p;, {k, 1, Sqrt[nmax]}]; Take[CoefficientList[s, x], nmax + 1]

a(n) ~ c * A333198^sqrt(n) / sqrt(n), where c = 0.3207396095989103757477946185... = sqrt((1 - (2/(23*(23 + 3*sqrt(69))))^(1/3) + ((1/2)*(23 + 3*sqrt(69)))^(1/3)/23^(2/3))/3)/2, c = sqrt(s)/2, where s is the real root of the equation -1 + 8*s - 23*s^2 + 23*s^3 = 0.

Limit_{n->infinity} A306734(n) / a(n) = A060006 = (1/2 + sqrt(23/3)/6)^(1/3) + (1/2 - sqrt(23/3)/6)^(1/3) = 1.32471795724474602596090885...

A098884 Number of partitions of n into distinct parts in which each part is congruent to 1 or 5 mod 6.

Original entry on oeis.org

1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 2, 2, 1, 0, 1, 2, 3, 3, 2, 1, 1, 3, 5, 5, 3, 1, 2, 5, 7, 7, 5, 3, 3, 7, 11, 11, 7, 4, 6, 11, 15, 15, 11, 7, 8, 15, 22, 22, 15, 10, 13, 22, 30, 30, 23, 16, 18, 30, 42, 42, 31, 22, 27, 43, 56, 56, 44, 33, 37, 57, 77, 77, 59, 45, 53, 79, 101, 101, 82, 64, 71

Offset: 0

Noureddine Chair, Oct 14 2004

nonn

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Convolution of A281244 and A280456. - Vaclav Kotesovec, Jan 18 2017

			E.g. a(25)=5 because 25=19+5+1=17+7+1=13+7+5=13+11+1.
G.f. = 1 + x + x^5 + x^6 + x^7 + x^8 + x^11 + 2*x^12 + 2*x^13 + x^14 + x^16 + ...
G.f. = q + q^13 + q^61 + q^73 + q^85 + q^97 + q^133 + 2*q^145 + 2*q^157 + q^169 + ...

Reinhard Zumkeller and Vaclav Kotesovec, Table of n, a(n) for n = 0..20000 (terms 0..300 from Reinhard Zumkeller)
Noureddine Chair, Partition Identities From Partial Supersymmetry, arXiv:hep-th/0409011v1, 2004.
David J. Hemmer, Generating functions for fixed points of the Mullineux map, arXiv:2402.03643 [math.CO], 2024.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A109389, A227398.

Cf. A007310, A056970, A096981, A097451.

a098884 = p a007310_list where
   p _  0     = 1
   p (k:ks) m = if k > m then 0 else p ks (m - k) + p ks m
-- Reinhard Zumkeller, Feb 19 2013

series(product((1+x^(6*k-1))*(1+x^(6*k-5)),k=1..100),x=0,100);

a[ n_] := SeriesCoefficient[ Product[ 1 - (-x)^k + x^(2 k), {k, n}], {x, 0, n}]; (* Michael Somos, Sep 20 2013 *)
a[ n_] := SeriesCoefficient[ 1 / Product[ 1 - x^k + x^(2 k), {k, 1, n, 2}], {x, 0, n}]; (* Michael Somos, Sep 20 2013 *)
a[ n_] := SeriesCoefficient[ Product[ 1 + x^k, {k, 1, n, 2}] / Product[ 1 + x^k, {k, 3, n, 6}], {x, 0, n}]; (* Michael Somos, Sep 20 2013 *)
a[ n_] := SeriesCoefficient[ Product[ 1 + x^k, {k, 1, n, 6}] Product[ 1 + x^k, {k, 5, n, 6}], {x, 0, n}]; (* Michael Somos, Sep 20 2013 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ -x, x^6] QPochhammer[ -x^5, x^6], {x, 0, n}]; (* Michael Somos, Sep 20 2013 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ -x, x^2] / QPochhammer[ -x^3, x^6], {x, 0, n}]; (* Michael Somos, Sep 20 2013 *)

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

{a(n) = my(A, m); if( n<0, 0, A = x * O(x^n); m = sqrtint(3*n + 1); polcoeff( sum(k= -((m-1)\3), (m+1)\3, x^(k * (3*k - 2)), A) / eta(x^6 + A), n))}; /* Michael Somos, Sep 20 2013 */

Expansion of chi(x) / chi(x^3) in powers of x where chi() is a Ramanujan theta function. - Michael Somos, Sep 20 2013
Expansion of f(x^1, x^5) / f(-x^6) in powers of x where f(,) is a Ramanujan theta function. - Michael Somos, Sep 20 2013
Expansion of G(x^6) * H(-x) + x * G(-x) * H(x^6) where G() (A003114), H() (A003106) are Rogers-Ramanujan functions.
Expansion of q^(-1/12) * eta(q^2)^2 * eta(q^3) * eta(q^12) / (eta(q) * eta(q^4) * eta(q^6)^2) in powers of q.
Euler transform of period 12 sequence [ 1, -1, 0, 0, 1, 0, 1, 0, 0, -1, 1, 0, ...]. - Michael Somos, Jun 26 2005
G.f. is a period 1 Fourier series which satisfies f(-1 / (12 t)) = g(t) where q = exp(2 Pi i t) and g() is the g.f. for A227398. - Michael Somos, Sep 20 2013
G.f.: Product_{k>0} (1 - (-x)^k + x^(2*k)).
G.f.: 1 / Product_{k>0} (1 - x^(2*k - 1) + x^(4*k - 2)).
G.f.: 1 / Product_{k>0} ((1 + x^(6*k - 3)) / (1 + x^(2*k - 1))).
G.f.: Product_{k>0} ((1 + x^(6*k - 1)) * (1 + x^(6*k - 5))).
G.f.: 1 / Product_{k>0} (1  + (-x)^(3*k - 1)) * (1 + (-x)^(3*k - 2)).
G.f.: (Sum_{k in Z} x^(k * (3*k - 2))) / (Sum_{k in Z} (-1)^k * x^(3*k * (3*k-1))).
A109389(n) = (-1)^n * a(n). Convolution inverse of A227398.
a(n) ~ exp(sqrt(n)*Pi/3)/ (2*sqrt(6)*n^(3/4)) * (1 + (Pi/72 - 9/(8*Pi)) / sqrt(n)). - Vaclav Kotesovec, Aug 30 2015, extended Jan 18 2017

Typo in Maple program fixed by Vaclav Kotesovec, Nov 15 2016

A113297 Expansion of chi(-q) / chi(-q^7) in powers of q where chi() is a Ramanujan theta function.

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 1, 0, 1, -2, 1, -1, 2, -2, 3, -3, 3, -4, 4, -4, 5, -4, 4, -6, 6, -7, 7, -8, 11, -11, 10, -12, 14, -15, 15, -14, 17, -20, 19, -21, 24, -26, 30, -31, 32, -37, 38, -40, 45, -44, 47, -54, 56, -60, 64, -68, 79, -83, 83, -92, 100, -105, 110, -112, 123, -136, 138, -147, 160, -170, 185, -194, 203

Offset: 0

Michael Somos, Oct 23 2005

sign

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Rogers-Ramanujan functions: G(q) (see A003114), H(q) (A003106).
In general, if m > 1 and g.f. = Product_{k>=1} (1 + x^(m*k))/(1 + x^k), then a(n) ~ (-1)^n * exp(Pi*sqrt((m+2)*n/(6*m))) * (m+2)^(1/4) / (4 * (6*m)^(1/4) * n^(3/4)) if m is even and a(n) ~ (-1)^n * exp(Pi*sqrt((m-1)*n/(6*m))) * (m-1)^(1/4) / (2^(3/2) * (6*m)^(1/4) * n^(3/4)) if m is odd. - Vaclav Kotesovec, Aug 31 2015

			G.f. = 1 - x - x^3 + x^4 - x^5 + x^6 + x^8 - 2*x^9 + x^10 - x^11 + ...
G.f. = q - q^5 - q^13 + q^17 - q^21 + q^25 + q^33 - 2*q^37 + q^41 + ...

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from G. C. Greubel)
F. G. Garvan and H. Yesilyurt, Shifted and shiftless partition identities II, arXiv:math/0605317 [math.NT], 2003.
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. 14.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A097793.

Cf. A081360 (m=2), A109389 (m=3), A261734 (m=4), A133563 (m=5), A261736 (m=6), A261735 (m=8), A261733 (m=9), A145707 (m=10).

seq(coeff(series(mul((1+x^(7*k))/(1+x^k),k=1..n), x,n+1),x,n),n=0..80); # Muniru A Asiru, Jul 29 2018

a[ n_] := SeriesCoefficient[ QPochhammer[ x] QPochhammer[ x^14] / (QPochhammer[ x^2] QPochhammer[ x^7]), {x, 0, n}]; (* Michael Somos, Aug 26 2015 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x  + A) * eta(x^14 + A) / (eta(x^2 + A) * eta(x^7 + A)), n))};

Expansion of q^(-1/4) * eta(q) * eta(q^14) / ( eta(q^2) * eta(q^7) ) in powers of q.
Euler transform of period 14 sequence [ -1, 0, -1, 0, -1, 0, 0, 0, -1, 0, -1, 0, -1, 0, ...].
G.f. A(x) = G(x^7) * H(x^2) - x * G(x^2) * H(x^7) where G(x) and H(x) are the Rogers-Ramanujan functions.
G.f.: Product_{k>0} (1 + x^(7*k)) / (1 + x^k).
Expansion of chi(-q) / chi(-q^7) in powers of q where chi() is a Ramanujan theta function.
G.f. is a period 1 Fourier series which satisfies f(-1 / (224 t)) = f(t) where q = exp(2 Pi i t).
G.f.: Product_{k>0} P14(x^k) where P14 is the 14th cyclotomic polynomial.
Convolution inverse is A097793.
a(n) ~ (-1)^n * exp(Pi*sqrt(n/7)) / (2^(3/2) * 7^(1/4) * n^(3/4)). - Vaclav Kotesovec, Aug 31 2015

A003113 Coefficients in expansion of permanent of infinite tridiagonal matrix shown below.

Original entry on oeis.org

2, 1, 2, 2, 3, 3, 5, 5, 7, 8, 10, 11, 15, 16, 20, 23, 28, 31, 38, 42, 51, 57, 67, 75, 89, 99, 115, 129, 149, 166, 192, 213, 244, 272, 309, 344, 391, 433, 489, 543, 611, 676, 760, 839, 939, 1038, 1157, 1276, 1422, 1565, 1738, 1913, 2119, 2328, 2576, 2826, 3120

Offset: 0

N. J. A. Sloane, Herman P. Robinson

nonn

1 0 0 0 0 0 ...
1 x 0 0 0 0 0 ...
x 1 x^2 0 0 0 ...
0 x^2 1 x^3 0 0 ...
0 0 x^3 1 x^4 0 0 0 ...
...................

D. H. Lehmer, Course on History of Mathematics, Univ. Calif. Berkeley, 1973.
H. P. Robinson, Letter to N. J. A. Sloane, Jan 04 1974.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
Herman P. Robinson, Letter to N. J. A. Sloane, Jan 1974.

Cf. A119469, A003114, A003106.

The generalized Rogers-Ramanujan series G[1], G[2], G[3], G[4], G[5], G[6], G[7], G[8] are A003114, A003106, A006141, A264591, A264592, A264593, A264594, A264595. The present sequence, which is G[1]+G[2], plays the role of G[0].

nmax = 60; CoefficientList[1 + Series[Sum[x^(j*(j-1))/Product[1 - x^i, {i, 1, j}], {j, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jan 02 2016 *)

G.f.: 1 + sum(i>=1, x^(i*(i-1))/prod(j=1..i, 1-x^j)) - Jon Perry, Jul 04 2004
a(n) = A003114(n)+A003106(n). So this is the sum of the two famous Rogers-Ramanujan series. - Vladeta Jovovic, Jul 17 2004
G.f.: sum(n>=0,(q^(n^2)*(1+q^n)) / prod(k=1..n,1-q^k)). [Joerg Arndt, Oct 08 2012]
a(n) ~ (9+4*sqrt(5))^(1/4) * exp(2*Pi*sqrt(n/15)) / (2*3^(1/4)*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Jan 02 2016

More terms from Vladeta Jovovic, Aug 30 2001

cp's OEIS Frontend

A007325 G.f.: Product_{k>0} (1-x^(5k-1))*(1-x^(5k-4))/((1-x^(5k-2))*(1-x^(5k-3))).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

PARI

Formula

A047221 Numbers that are congruent to {2, 3} mod 5.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

Extensions

A039900 Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A122129 Expansion of 1 + Sum_{k>0} x^k^2/((1-x)(1-x^2)...(1-x^(2k))).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A122134 Expansion of Sum_{k>=0} x^(k^2+k)/((1-x)(1-x^2)...(1-x^(2k))).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A219607 Number of partitions of n into distinct parts 5*k+2 or 5*k+3.

Views

Author

Keywords

Comments

Examples

Links

A007325 G.f.: Product_{k>0} (1-x^(5k-1))(1-x^(5k-4))/((1-x^(5k-2))(1-x^(5k-3))).

A219607 Number of partitions of n into distinct parts 5k+2 or 5k+3.

A333179 G.f.: Sum_{k>=0} (x^(k(k+1)) Product_{j=1..k} (1 + x^j)).