A035382 -id:A035382 - cp's OEIS frontend

A109703 Number of partitions of n into parts each equal to 1 mod 7.

1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 5, 6, 7, 7, 7, 7, 7, 8, 10, 11, 12, 12, 12, 12, 13, 15, 17, 18, 19, 19, 19, 20, 23, 26, 28, 29, 30, 30, 31, 34, 38, 41, 43, 44, 45, 46, 50, 55, 60, 63, 65, 66, 68, 72, 79, 85, 90, 93, 95, 97, 103, 111, 120, 127, 132, 135

Offset: 0

Erich Friedman, Aug 07 2005

nonn

			a(15)=3 because we have 15=8+1+1+1+1+1+1+1=1+1+1+1+1+1+1+1+1+1+1+1+1+1+1.

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000
Vaclav Kotesovec, Graph - The asymptotic ratio

Cf. A284099.

Cf. similar sequences of number of partitions of n into parts congruent to 1 mod m: A000009 (m=2), A035382 (m=3), A035451 (m=4), A109697 (m=5), A109701 (m=6), this sequence (m=7), A277090 (m=8).

g:=1/product(1-x^(1+7*j),j=0..20): gser:=series(g,x=0,80): seq(coeff(gser,x,n),n=0..77); # Emeric Deutsch, Apr 14 2006

nmax=100; CoefficientList[Series[Product[1/(1-x^(7*k+1)),{k, 0, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Feb 27 2015 *)

G.f.: 1/product(1-x^(1+7j), j=0..infinity). - Emeric Deutsch, Apr 14 2006
a(n) ~ Gamma(1/7) * exp(Pi*sqrt(2*n/21)) / (2^(11/7) * 3^(1/14) * 7^(3/7) * Pi^(6/7) * n^(4/7)) * (1 - (2*sqrt(6/7)/(7*Pi) + 13*Pi/(168*sqrt(42))) / sqrt(n)). - Vaclav Kotesovec, Feb 27 2015, extended Jan 24 2017
a(n) = (1/n)*Sum_{k=1..n} A284099(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 20 2017
G.f.: Sum_{k>=0} x^k / Product_{j=1..k} (1 - x^(7*j)). - Ilya Gutkovskiy, Jul 17 2019

Changed offset to 0 and added a(0)=1 by Vaclav Kotesovec, Feb 27 2015

A262923 Expansion of Product_{k>=1} 1 / ((1-x^(3k-1))^(3k-1) * (1-x^(3k-2))^(3k-2)).

Original entry on oeis.org

1, 1, 3, 3, 10, 15, 27, 44, 79, 128, 211, 331, 549, 843, 1338, 2061, 3195, 4851, 7384, 11104, 16696, 24774, 36817, 54173, 79560, 116067, 168880, 244293, 352480, 506012, 724531, 1032762, 1468271, 2079525, 2937102, 4134399, 5804795, 8124459, 11342952, 15791650

Offset: 0

Vaclav Kotesovec, Oct 04 2015

nonn

Convolution of A262946 and A262947.

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Vaclav Kotesovec)
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.

Cf. A262883, A262876, A262877, A262924, A035386, A035382, A262946, A262947.

nmax=60; CoefficientList[Series[Product[1/((1 - x^(3*k-1))^(3*k-1) * (1 - x^(3*k-2))^(3*k-2)), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) ~ exp(-1/6 + 3^(2/3)*(Zeta(3)/2)^(1/3) * n^(2/3)) * A^2 * Zeta(3)^(1/9) / (2^(5/18) * 3^(31/36) * sqrt(Pi) * n^(11/18)), where Zeta(3) = A002117 and A = A074962 is the Glaisher-Kinkelin constant.

A337547 Number of compositions (ordered partitions) of n into distinct parts congruent to 1 mod 3.

Original entry on oeis.org

1, 1, 0, 0, 1, 2, 0, 1, 2, 0, 1, 4, 6, 1, 4, 6, 1, 6, 12, 1, 6, 18, 25, 8, 24, 25, 8, 30, 49, 10, 42, 73, 10, 48, 121, 132, 60, 145, 132, 72, 217, 254, 84, 265, 374, 96, 361, 616, 114, 433, 856, 846, 553, 1218, 864, 649, 1578, 1602, 817, 2180, 2340, 937, 2780, 3798, 1129, 3622

Offset: 0

Ilya Gutkovskiy, Nov 22 2020

nonn

			a(12) = 6 because we have [7, 4, 1], [7, 1, 4], [4, 7, 1], [4, 1, 7], [1, 7, 4] and [1, 4, 7].

Index entries for sequences related to compositions

Cf. A000930, A016777, A032020, A032021, A035382, A261612, A337548, A339059, A339060.

nmax = 65; CoefficientList[Series[Sum[k! x^(k (3 k - 1)/2)/Product[1 - x^(3 j), {j, 1, k}], {k, 0, nmax}], {x, 0, nmax}], x]

G.f.: Sum_{k>=0} k! * x^(k*(3*k - 1)/2) / Product_{j=1..k} (1 - x^(3*j)).

A261616 Expansion of Product_{k>=0} 1/(1 - x^(3*k+1))^2.

Original entry on oeis.org

1, 2, 3, 4, 7, 10, 13, 18, 26, 34, 44, 58, 76, 96, 123, 156, 196, 244, 304, 374, 461, 566, 690, 836, 1015, 1224, 1470, 1762, 2110, 2512, 2987, 3542, 4191, 4944, 5825, 6842, 8025, 9392, 10971, 12788, 14891, 17300, 20068, 23242, 26883, 31034, 35787, 41204

Offset: 0

Vaclav Kotesovec, Aug 26 2015

nonn

Self-convolution of A035382.

In general, if a > 0, b > 0, GCD(a,b) = 1 and g.f. = Product_{k>=0} 1/(1 - x^(a*k+b))^2, then a(n) ~ Gamma(b/a)^2 * a^(b/a - 3/4) * exp(2*Pi*sqrt(n/(3*a))) * Pi^(2*b/a - 2) / (4 * 3^(b/a - 1/4) * n^(b/a + 1/4)).

Cf. A022567, A035382, A261610, A261612, A261615.

nmax = 60; CoefficientList[Series[Product[1/(1 - x^(3*k+1))^2, {k, 0, nmax}], {x, 0, nmax}], x]

a(n) ~ exp(2*Pi*sqrt(n)/3) * Gamma(1/3)^2 / (4 * sqrt(3) * Pi^(4/3) * n^(7/12)).

A277090 Expansion of Product_{k>=0} 1/(1 - x^(8*k+1)).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 5, 6, 7, 7, 7, 7, 7, 7, 8, 10, 11, 12, 12, 12, 12, 12, 13, 15, 17, 18, 19, 19, 19, 19, 20, 23, 26, 28, 29, 30, 30, 30, 31, 34, 38, 41, 43, 44, 45, 45, 46, 50, 55, 60, 63, 65, 66, 67, 68, 72, 79, 85, 90, 93, 95, 96, 98, 103, 111, 120, 127, 132, 135, 137, 139, 145

Offset: 0

Ilya Gutkovskiy, Sep 29 2016

nonn

Number of partitions of n into parts congruent to 1 mod 8.

More generally, the ordinary generating function for the number of partitions of n into parts congruent to 1 mod m (for m>0) is Product_{k>=0} 1/(1 - x^(m*k+1)).

			a(10) = 2, because we have [9, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1, 1].

Seiichi Manyama, Table of n, a(n) for n = 0..10000
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.
Index entries for related partition-counting sequences

Cf. A017077, A284100.

Cf. similar sequences of number of partitions of n into parts congruent to 1 mod m: A000009 (m=2), A035382 (m=3), A035451 (m=4), A109697 (m=5), A109701 (m=6), A109703 (m=7).

CoefficientList[Series[QPochhammer[x, x^8]^(-1), {x, 0, 90}], x]

G.f.: Product_{k>=0} 1/(1 - x^(8*k+1)).
a(n) ~ exp((Pi*sqrt(n))/(2*sqrt(3)))*Gamma(1/8)/(4*3^(1/16)*(2*Pi)^(7/8)*n^(9/16)).
a(n) = (1/n)*Sum_{k=1..n} A284100(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 20 2017

A261615 Expansion of Product_{k>=0} (1 + x^(3*k+1))^2.

Original entry on oeis.org

1, 2, 1, 0, 2, 4, 2, 2, 5, 4, 3, 8, 10, 6, 9, 14, 11, 14, 22, 18, 17, 30, 32, 28, 41, 46, 39, 54, 68, 60, 73, 94, 85, 96, 131, 128, 130, 170, 175, 176, 229, 246, 237, 294, 330, 320, 386, 446, 430, 492, 582, 578, 642, 762, 763, 818, 977, 1008, 1061, 1254, 1311

Offset: 0

Vaclav Kotesovec, Aug 26 2015

nonn

Self-convolution of A261612.

In general, if a > 0, b > 0, GCD(a,b) = 1 and g.f. = Product_{k>=0} (1 + x^(a*k+b))^2, then a(n) ~ exp(Pi*sqrt(2*n/(3*a))) / (2^(2*b/a + 1/4) * 3^(1/4) * a^(1/4) * n^(3/4)).

Cf. A022567, A035382, A261610, A261612, A261616.

nmax = 60; CoefficientList[Series[Product[(1 + x^(3*k+1))^2, {k, 0, nmax}], {x, 0, nmax}], x]

a(n) ~ exp(Pi*sqrt(2*n)/3) / (2^(11/12) * sqrt(3) * n^(3/4)).

A374065 Expansion of Product_{k>=1} 1 / (1 + x^(3*k-2)).

Original entry on oeis.org

1, -1, 1, -1, 0, 0, 0, -1, 2, -2, 1, 0, -1, 0, 2, -3, 3, -1, -1, 1, 1, -4, 5, -3, 0, 2, 0, -4, 7, -6, 1, 3, -2, -3, 9, -10, 4, 3, -5, -1, 11, -15, 10, 1, -8, 3, 10, -20, 17, -3, -10, 9, 7, -24, 26, -10, -10, 15, 2, -27, 37, -21, -8, 22, -6, -28, 49, -36, -2, 30, -19, -24, 61, -56, 10, 35

Offset: 0

Ilya Gutkovskiy, Jun 27 2024

sign

Cf. A035382, A081360, A081362, A109389, A132462, A261612, A262928, A284312, A374064.

nmax = 75; CoefficientList[Series[Product[1/(1 + x^(3 k - 2)), {k, 1, nmax}], {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = (1/n) Sum[DivisorSum[k, (-1)^(k/#) # &, Mod[#, 3] == 1 &] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 75}]

a(0) = 1; a(n) = -Sum_{k=1..n} A261612(k) * a(n-k).
a(n) = Sum_{k=0..n} A081362(k) * A132462(n-k).
a(n) = Sum_{k=0..n} A109389(k) * A262928(n-k).

A374060 Expansion of Product_{k>=1} (1 - x^(3k-1)) (1 - x^(3*k)).

Original entry on oeis.org

1, 0, -1, -1, 0, 0, -1, 1, 1, 0, 0, 1, 0, 0, 1, 0, -1, 0, 0, -1, 0, 1, -1, -1, 0, -1, 0, 1, 0, -1, 1, 0, -1, 1, 1, -1, 0, 1, 0, 1, 1, -1, 0, 1, -1, -1, 2, 0, -1, 1, 0, -1, 1, 0, -2, 0, 0, -1, 1, 1, -2, 0, 1, -2, 0, 2, -1, -1, 1, -1, -1, 2, -1, -1, 2, 0, -1, 2, 1, -2, 1, 0, -2, 2, 1, -2

Offset: 0

Ilya Gutkovskiy, Jun 27 2024

sign

Ilya Gutkovskiy, Scatterplot of a(n) up to n=10000

Cf. A010815, A035361, A035382, A081362, A082050, A132462, A137569, A274719, A284315, A374058.

nmax = 85; CoefficientList[Series[Product[(1 - x^(3 k - 1)) (1 - x^(3 k)), {k, 1, nmax}], {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = -(1/n) Sum[Plus @@ Select[Divisors[k], Mod[#, 3] != 1 &] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 85}]

a(0) = 1; a(n) = -(1/n) * Sum_{k=1..n} A082050(k) * a(n-k).
a(0) = 1; a(n) = -Sum_{k=1..n} A035361(k) * a(n-k).
a(n) = Sum_{k=0..n} A010815(k) * A035382(n-k).

A261632 Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^3.

Original entry on oeis.org

1, 3, 6, 10, 15, 24, 37, 54, 75, 103, 144, 198, 265, 348, 456, 599, 777, 993, 1262, 1602, 2028, 2543, 3165, 3930, 4868, 6003, 7359, 8991, 10965, 13329, 16138, 19473, 23448, 28171, 33738, 40293, 48025, 57132, 67803, 80267, 94845, 111888, 131736, 154779, 181530

Offset: 0

Vaclav Kotesovec, Aug 27 2015

nonn

Cf. A035382, A261616, A261631, A035451, A261629.

nmax=50; CoefficientList[Series[Product[1/(1-x^(4*k+1))^3, {k, 0, nmax}], {x, 0, nmax}], x]

a(n) ~ exp(Pi*sqrt(n/2)) * 2^(3/8) * Gamma(1/4)^3 / (16 * Pi^(9/4) * n^(3/8)).

A261636 Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^4.

Original entry on oeis.org

1, 4, 10, 20, 35, 60, 100, 160, 245, 364, 536, 780, 1115, 1564, 2166, 2980, 4065, 5484, 7326, 9720, 12830, 16824, 21902, 28344, 36510, 46820, 59736, 75844, 95910, 120844, 151688, 189668, 236330, 293564, 363542, 448804, 552425, 678144, 830338, 1014052, 1235296

Offset: 0

Vaclav Kotesovec, Aug 27 2015

nonn

In general, if j > 0, a > 0, b > 0, GCD(a,b) = 1 and g.f. = Product_{k>=0} 1/(1 - x^(a*k+b))^j, then a(n) ~ Gamma(b/a)^j * 2^(-(j+5)/4 - j*b/(2*a)) * 3^((j-1)/4 - j*b/(2*a)) * j^(-(j-1)/4 + j*b/(2*a)) * a^(-(j+1)/4 + j*b/(2*a)) * Pi^(-j + j*b/a) * n^((j-3)/4 - j*b/(2*a)) * exp(Pi*sqrt(2*j*n/(3*a))).

Cf. A035382, A261616, A261635, A035451, A261629, A261632.

nmax=50; CoefficientList[Series[Product[1/(1-x^(4*k+1))^4, {k, 0, nmax}], {x, 0, nmax}], x]

a(n) ~ exp(Pi*sqrt(2*n/3)) * 6^(1/4) * Gamma(1/4)^4 / (32 * Pi^3 * n^(1/4)).

cp's OEIS Frontend

A109703 Number of partitions of n into parts each equal to 1 mod 7.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A262923 Expansion of Product_{k>=1} 1 / ((1-x^(3*k-1))^(3*k-1) * (1-x^(3*k-2))^(3*k-2)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A337547 Number of compositions (ordered partitions) of n into distinct parts congruent to 1 mod 3.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A261616 Expansion of Product_{k>=0} 1/(1 - x^(3*k+1))^2.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A277090 Expansion of Product_{k>=0} 1/(1 - x^(8*k+1)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A261615 Expansion of Product_{k>=0} (1 + x^(3*k+1))^2.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A374065 Expansion of Product_{k>=1} 1 / (1 + x^(3*k-2)).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A374060 Expansion of Product_{k>=1} (1 - x^(3*k-1)) * (1 - x^(3*k)).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A261632 Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^3.

A262923 Expansion of Product_{k>=1} 1 / ((1-x^(3k-1))^(3k-1) * (1-x^(3k-2))^(3k-2)).

A374060 Expansion of Product_{k>=1} (1 - x^(3k-1)) (1 - x^(3*k)).