A217093
Number of partitions of n objects of 3 colors.
Original entry on oeis.org
1, 3, 12, 38, 117, 330, 906, 2367, 6027, 14873, 35892, 84657, 196018, 445746, 997962, 2201438, 4792005, 10300950, 21889368, 46012119, 95746284, 197344937, 403121547, 816501180, 1640549317, 3271188702, 6475456896, 12730032791, 24861111315, 48246729411, 93065426256
Offset: 0
We represent each summand, k, in a partition of n as k identical objects. Then we color each object. We have no regard for the order of the colored objects.
a(2) = 12 because we have: ww; wg; wb; gg; gb; bb; w + w; w + g; w + b; g + g; g + b; b + b, where the 3 colors are white w, gray g, and black b.
- Alois P. Heinz, Table of n, a(n) for n = 0..1000
- S. Benvenuti, B. Feng, A. Hanany and Y. H. He, Counting BPS operators in gauge theories: Quivers, syzygies and plethystics, arXiv:hep-th/0608050, Aug 2006, p.42.
- Carlos A. A. Florentino, Plethystic exponential calculus and permutation polynomials, arXiv:2105.13049 [math.CO], 2021. Mentions this sequence.
- Vaclav Kotesovec, Graph - The asymptotic ratio
Cf.
A005380,
A120844,
A253289,
A255050,
A255052,
A255802,
A255803,
A255835,
A255836,
A363601,
A363602.
-
with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1, add(add(
d*binomial(d+2, 2), d=divisors(j))*a(n-j), j=1..n)/n)
end:
seq(a(n), n=0..30); # Alois P. Heinz, Sep 26 2012
with(numtheory):
series(exp(add(((1/2)*sigma[3](k) + (3/2)*sigma[2](k) + sigma[1](k))*x^k/k, k = 1..30)), x, 31):
seq(coeftayl(%, x = 0, n), n = 0..30); # Peter Bala, Jan 16 2025
-
nn=30; p=Product[1/(1- x^i)^Binomial[i+2,2],{i,1,nn}]; CoefficientList[Series[p,{x,0,nn}],x]
-
from functools import lru_cache
from sympy import divisors
@lru_cache(maxsize=None)
def A217093_aux(n): return sum(d*(d+1)*(d+2)>>1 for d in divisors(n,generator=True))
@lru_cache(maxsize=None)
def A217093(n): return 1 if n == 0 else (A217093_aux(n)+sum(A217093_aux(k)*A217093(n-k) for k in range(1,n)))//n # Chai Wah Wu, Mar 19 2025
A253289
G.f.: Product_{k>=1} 1/(1-x^k)^(2*k-1).
Original entry on oeis.org
1, 1, 4, 9, 22, 46, 103, 208, 431, 849, 1671, 3195, 6079, 11321, 20937, 38146, 68931, 123121, 218212, 383019, 667425, 1153544, 1980268, 3375394, 5717773, 9624541, 16108496, 26807662, 44379189, 73089219, 119789926, 195401275, 317309532, 513025167, 826000651
Offset: 0
Cf.
A005380,
A120844,
A217093,
A253289,
A255271,
A255802,
A255803,
A255835,
A255836,
A363601,
A363602.
-
with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d, j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:=etr(n-> 2*n-1): seq(a(n), n=0..50); # after Alois P. Heinz
with(numtheory):
series(exp(add((2*sigma[2](k) - sigma[1](k))*x^k/k, k = 1..30)), x, 31):
seq(coeftayl(%, x = 0, n), n = 0..30); # Peter Bala, Jan 16 2025
-
nmax=50; CoefficientList[Series[Product[1/(1-x^k)^(2*k-1),{k,1,nmax}],{x,0,nmax}],x]
(* Using EulerTransforms from 'Transforms'. *)
Prepend[EulerTransform[Table[2k + 1, {k, 0, 20}]], 1] (* Peter Luschny, Aug 15 2020 *)
A120844
Number of multi-trace BPS operators for the quiver gauge theory of the orbifold C^2/Z_2.
Original entry on oeis.org
1, 3, 11, 32, 90, 231, 576, 1363, 3141, 7003, 15261, 32468, 67788, 138892, 280103, 556302, 1089991, 2108332, 4030649, 7620671, 14261450, 26431346, 48544170, 88393064, 159654022, 286149924, 509137464, 899603036, 1579014769
Offset: 0
Amihay Hanany (hanany(AT)mit.edu), Aug 25 2006
Cf.
A000203,
A001157,
A005380,
A217093,
A253289,
A255271,
A255802,
A255803,
A255834,
A255835,
A255836,
A363601,
A363602.
-
with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d, j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:=etr(n-> 2*n+1): seq(a(n), n=0..50); # Vaclav Kotesovec, Mar 06 2015 after Alois P. Heinz
# alternative program
with(numtheory):
series(exp(add((2*sigma[2](k) + sigma[1](k))*x^k/k, k = 1..30)), x, 31):
seq(coeftayl(%, x = 0, n), n = 0..30); # Peter Bala, Jan 16 2025
-
nmax=50; CoefficientList[Series[Product[1/(1-x^k)^(2*k+1),{k,1,nmax}],{x,0,nmax}],x] (* Vaclav Kotesovec, Feb 27 2015 *)
A363601
Number of partitions of n where there are k^2 - 1 kinds of parts k.
Original entry on oeis.org
1, 0, 3, 8, 21, 48, 126, 288, 693, 1568, 3570, 7896, 17417, 37632, 80823, 171192, 359733, 747936, 1543192, 3155760, 6407037, 12909024, 25835649, 51359136, 101470854, 199264128, 389096028, 755591256, 1459643343, 2805471984, 5366161740, 10216161336, 19362398580
Offset: 0
Cf.
A005380,
A023871,
A052847,
A092348,
A120844,
A217093,
A253289,
A255271,
A255802,
A255803,
A255835,
A255836,
A363602.
-
with(numtheory):
series(exp(add((sigma[3](k) - sigma[1](k))*x^k/k, k = 1..50)), x, 51):
seq(coeftayl(%, x = 0, n), n = 0..50); # Peter Bala, Jan 16 2025
-
my(N=40, x='x+O('x^N)); Vec(1/prod(k=1, N, (1-x^k)^(k^2-1)))
A255271
G.f.: Product_{k>=1} 1/(1-x^k)^(3*k+1).
Original entry on oeis.org
1, 4, 17, 58, 186, 546, 1532, 4082, 10502, 26096, 63075, 148536, 342096, 771744, 1709299, 3721792, 7978972, 16860328, 35155475, 72393580, 147351112, 296657196, 591141762, 1166570452, 2281101159, 4421781894, 8500806341, 16214549920, 30696683828
Offset: 0
-
with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d, j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:=etr(n-> 3*n+1): seq(a(n), n=0..50); # after Alois P. Heinz
with(numtheory):
series(exp(add((3*sigma[2](k) + sigma[1](k))*x^k/k, k = 1..30)), x, 31):
seq(coeftayl(%, x = 0, n), n = 0..30); # Peter Bala, Jan 16 2025
-
nmax=50; CoefficientList[Series[Product[1/(1-x^k)^(3*k+1),{k,1,nmax}],{x,0,nmax}],x]
A255802
G.f.: Product_{k>=1} 1/(1-x^k)^(2*k+3).
Original entry on oeis.org
1, 5, 22, 79, 259, 777, 2201, 5911, 15239, 37865, 91224, 213741, 488759, 1093173, 2396934, 5160756, 10928181, 22787949, 46848176, 95046026, 190466354, 377295743, 739319876, 1433974869, 2754597217, 5243308562, 9894376295, 18517966608, 34386781020, 63378252332
Offset: 0
Cf.
A005380,
A120844,
A217093,
A253289,
A255271,
A255803,
A255834,
A255835,
A255836,
A363601,
A363602.
-
with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d, j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:=etr(n-> 2*n+3): seq(a(n), n=0..50); # after Alois P. Heinz
with(numtheory):
series(exp(add((2*sigma[2](k) + 3*sigma[1](k))*x^k/k, k = 1..30)), x, 31):
seq(coeftayl(%, x = 0, n), n = 0..30); # Peter Bala, Jan 16 2025
-
nmax=50; CoefficientList[Series[Product[1/(1-x^k)^(2*k+3),{k,1,nmax}],{x,0,nmax}],x]
A255837
G.f.: Product_{k>=1} (1+x^k)^(3*k+2).
Original entry on oeis.org
1, 5, 18, 61, 182, 506, 1338, 3369, 8172, 19197, 43833, 97636, 212748, 454461, 953505, 1968095, 4001627, 8024295, 15885484, 31074351, 60111277, 115071431, 218126868, 409662895, 762679151, 1408172844, 2579599582, 4690277001, 8467363674, 15182486586
Offset: 0
-
nmax=50; CoefficientList[Series[Product[(1+x^k)^(3*k+2),{k,1,nmax}],{x,0,nmax}],x]
Showing 1-7 of 7 results.
Comments