Search: a277996 -id:a277996
|
|
A317884
|
|
Number of series-reduced achiral free pure multifunctions (with empty expressions allowed) with one atom and n positions.
|
|
+0
6
|
|
|
1, 1, 1, 2, 4, 8, 14, 26, 47, 87, 160, 295, 540, 997, 1832, 3369, 6197, 11406, 20975, 38594, 70991, 130610, 240275, 442043, 813184, 1496053, 2752251, 5063319, 9314879, 17136632, 31526032, 57998423, 106699160, 196294065, 361120800, 664352454, 1222204958
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
A series-reduced achiral expression (SRAE) is either (case 1) the leaf symbol "o", or (case 2) a possibly empty but not unitary expression of the form h[g, ..., g], where h and g are SRAEs. The number of positions in an SRAE is the number of brackets [...] plus the number of o's.
Also the number of series-reduced achiral Mathematica expressions with one atom and n positions.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1; a(n > 1) = a(n-1) + Sum_{0 < k < n-1} a(k) * Sum_{d|(n-k-1), d < n-k-1} a(d).
|
|
EXAMPLE
|
The a(6) = 8 SRAEs:
o[o,o,o,o]
o[o[],o[]]
o[][o,o,o]
o[][][o,o]
o[o,o,o][]
o[][o,o][]
o[o,o][][]
o[][][][][]
|
|
MAPLE
|
a:= proc(n) option remember; `if`(n=1, 1, a(n-1)+add(a(j)*add(
a(d), d=numtheory[divisors](n-j-1) minus {n-j-1}), j=1..n-1))
end:
|
|
MATHEMATICA
|
allAchExprSR[n_] := If[n == 1, {"o"}, Join @@ Cases[Table[PR[k, n - k - 1], {k, n - 1}], PR[h_, g_] :> Join @@ Table[Apply @@@ Tuples[{allAchExprSR[h], Select[Tuples[allAchExprSR /@ p], SameQ @@ # &]}], {p, If[g == 0, {{}}, Join @@ Permutations /@ Rest[IntegerPartitions[g]]]}]]]; Table[Length[allAchExprSR[n]], {n, 12}]
(* Second program: *)
a[n_] := a[n] = If[n == 1, 1, a[n-1] + Sum[a[j]*DivisorSum[
n-j-1, If[# < n-j-1, a[#], 0]&], {j, 1, n-2}]];
|
|
PROG
|
(PARI) seq(n)={my(p=O(x)); for(n=1, n, p = x + p*x*(1 + sum(k=2, n-2, subst(p + O(x^(n\k+1)), x, x^k)) ) + O(x*x^n)); Vec(p)} \\ Andrew Howroyd, Aug 19 2018
(PARI) seq(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, v[n]=v[n-1] + sum(i=1, n-2, v[i]*sumdiv(n-i-1, d, if(d<n-i-1, v[d], 0)))); v} \\ Andrew Howroyd, Aug 19 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A318149
|
|
e-numbers of free pure symmetric multifunctions with one atom.
|
|
+0
5
|
|
|
1, 4, 16, 36, 128, 256, 441, 1296, 2025, 16384, 21025, 65536, 77841, 194481, 220900, 279936, 1679616, 1803649, 4100625, 4338889, 268435456, 273571600, 442050625, 449482401, 1801088541, 4294967296, 4334247225, 6059221281
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
If n = 1 let e(n) be the leaf symbol "o". Given a positive integer n > 1 we construct a unique orderless expression e(n) (as can be represented in functional programming languages such as Mathematica) with one atom by expressing n as a power of a number that is not a perfect power to a product of prime numbers: n = rad(x)^(prime(y_1) * ... * prime(y_k)) where rad = A007916. Then e(n) = e(x)[e(y_1), ..., e(y_k)]. For example, e(21025) = o[o[o]][o] because 21025 = rad(rad(1)^prime(rad(1)^prime(1)))^prime(1). The sequence consists of all numbers n such that e(n) contains no empty subexpressions f[].
|
|
LINKS
|
|
|
EXAMPLE
|
The sequence of free pure symmetric multifunctions with one atom "o", together with their e-numbers begins:
1: o
4: o[o]
16: o[o,o]
36: o[o][o]
128: o[o[o]]
256: o[o,o,o]
441: o[o,o][o]
1296: o[o][o,o]
2025: o[o][o][o]
16384: o[o,o[o]]
21025: o[o[o]][o]
65536: o[o,o,o,o]
77841: o[o,o,o][o]
194481: o[o,o][o,o]
220900: o[o,o][o][o]
279936: o[o][o[o]]
|
|
MATHEMATICA
|
nn=1000;
radQ[n_]:=If[n==1, False, GCD@@FactorInteger[n][[All, 2]]==1];
rad[n_]:=rad[n]=If[n==0, 1, NestWhile[#+1&, rad[n-1]+1, Not[radQ[#]]&]];
Clear[radPi]; Set@@@Array[radPi[rad[#]]==#&, nn];
exp[n_]:=If[n==1, "o", With[{g=GCD@@FactorInteger[n][[All, 2]]}, Apply[exp[radPi[Power[n, 1/g]]], exp/@Flatten[Cases[FactorInteger[g], {p_?PrimeQ, k_}:>ConstantArray[PrimePi[p], k]]]]]];
Select[Range[nn], FreeQ[exp[#], _[]]&]
|
|
PROG
|
(Python) See Neder link.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A317654
|
|
Number of free pure symmetric multifunctions whose leaves are a strongly normal multiset of size n.
|
|
+0
10
|
|
|
1, 3, 26, 375, 6696, 159837, 4389226, 144915350, 5377002075, 227624621051, 10632808475596, 550932945236121, 31062550998284221, 1907051034025848314, 126052420069459211076, 8956882232940915920404, 679298518935625486287703, 54868537321267493152151502, 4696952405203792017289469056
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities. A free pure symmetric multifunction f in EPSM is either (case 1) a positive integer, or (case 2) an expression of the form h[g_1, ..., g_k] where k > 0, h is in EPSM, each of the g_i for i = 1, ..., k is in EPSM, and for i < j we have g_i <= g_j under a canonical total ordering of EPSM, such as the Mathematica ordering of expressions.
|
|
LINKS
|
|
|
EXAMPLE
|
The a(3) = 26 free pure symmetric multifunctions:
1[1[1]], 1[1,1], 1[1][1],
1[1[2]], 1[2[1]], 1[1,2], 2[1[1]], 2[1,1], 1[1][2], 1[2][1], 2[1][1],
1[2[3]], 1[3[2]], 1[2,3], 2[1[3]], 2[3[1]], 2[1,3], 3[1[2]], 3[2[1]], 3[1,2], 1[2][3], 2[1][3], 1[3][2], 3[1][2], 2[3][1], 3[2][1].
|
|
MATHEMATICA
|
sps[{}]:={{}}; sps[set:{i_, ___}]:=Join@@Function[s, Prepend[#, s]&/@sps[Complement[set, s]]]/@Cases[Subsets[set], {i, ___}];
mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
exprUsing[m_]:=exprUsing[m]=If[Length[m]==0, {}, If[Length[m]==1, {First[m]}, Join@@Cases[Union[Table[PR[m[[s]], m[[Complement[Range[Length[m]], s]]]], {s, Take[Subsets[Range[Length[m]]], {2, -2}]}]], PR[h_, g_]:>Join@@Table[Apply@@@Tuples[{exprUsing[h], Union[Sort/@Tuples[exprUsing/@p]]}], {p, mps[g]}]]]];
got[y_]:=Join@@Table[Table[i, {y[[i]]}], {i, Range[Length[y]]}];
Table[Sum[Length[exprUsing[got[y]]], {y, IntegerPartitions[n]}], {n, 6}]
|
|
PROG
|
(PARI) \\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + p*(sExp(p)-1)); p}
StronglyNormalLabelingsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Jan 01 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A304485
|
|
Regular triangle where T(n,k) is the number of inequivalent colorings of free pure symmetric multifunctions (with empty expressions allowed) with n positions and k leaves.
|
|
+0
2
|
|
|
1, 1, 0, 1, 2, 0, 1, 6, 4, 0, 1, 12, 23, 7, 0, 1, 20, 81, 73, 12, 0, 1, 30, 209, 407, 206, 19, 0, 1, 42, 451, 1566, 1751, 534, 30, 0, 1, 56, 858, 4711, 9593, 6695, 1299, 45, 0, 1, 72, 1494, 11951, 39255, 51111, 23530, 3004, 67, 0, 1, 90, 2430, 26752, 130220, 278570, 245319, 77205, 6664, 97, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
A free pure symmetric multifunction (with empty expressions allowed) f in EOME is either (case 1) a positive integer, or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where k >= 0, h is in EOME, each of the g_i for i = 1, ..., k is in EOME, and for i < j we have g_i <= g_j under a canonical total ordering of EOME, such as the Mathematica ordering of expressions.
T(n,k) is also the number of inequivalent colorings of orderless Mathematica expressions with n positions and k leaves.
|
|
LINKS
|
|
|
EXAMPLE
|
Inequivalent representatives of the T(5,3) = 23 Mathematica expressions:
1[][1,1] 1[1,1][] 1[1][1] 1[1[1]] 1[1,1[]]
1[][1,2] 1[1,2][] 1[1][2] 1[1[2]] 1[1,2[]]
1[][2,2] 1[2,2][] 1[2][1] 1[2[1]] 1[2,1[]]
1[][2,3] 1[2,3][] 1[2][2] 1[2[2]] 1[2,2[]]
1[2][3] 1[2[3]] 1[2,3[]]
Triangle begins:
1
1 0
1 2 0
1 6 4 0
1 12 23 7 0
1 20 81 73 12 0
1 30 209 407 206 19 0
1 42 451 1566 1751 534 30 0
|
|
PROG
|
(PARI) \\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + x*p*sExp(p)); p}
T(n)={my(v=Vec(InequivalentColoringsSeq(sFuncSubst(cycleIndexSeries(n), i->sv(i)*y^i)))); vector(n, n, Vecrev(v[n]/y, n))}
{ my(A=T(10)); for(n=1, #A, print(A[n])) } \\ Andrew Howroyd, Jan 01 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A300626
|
|
Number of inequivalent colorings of free pure symmetric multifunctions (with empty expressions allowed) with n positions.
|
|
+0
6
|
|
|
1, 1, 3, 11, 43, 187, 872, 4375, 23258, 130485, 767348, 4710715, 30070205, 198983975, 1361361925, 9607908808, 69812787049, 521377973359, 3996036977270, 31389624598631, 252408597286705, 2075472033455894, 17434190966525003, 149476993511444023, 1307022313790487959
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
A free pure symmetric multifunction (with empty expressions allowed) f in EOME is either (case 1) a positive integer, or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where k >= 0, h is in EOME, each of the g_i for i = 1, ..., k is in EOME, and for i < j we have g_i <= g_j under a canonical total ordering of EOME, such as the Mathematica ordering of expressions.
Also the number of inequivalent colorings of orderless Mathematica expressions with n positions.
|
|
LINKS
|
|
|
EXAMPLE
|
Inequivalent representatives of the a(3) = 11 colorings:
1[1,1] 1[2,2] 1[1,2] 1[2,3]
1[1[]] 1[2[]]
1[][1] 1[][2]
1[1][] 1[2][]
1[][][]
|
|
PROG
|
(PARI) \\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + x*p*sExp(p)); p}
InequivalentColoringsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 30 2020
|
|
CROSSREFS
|
Cf. A000612, A007716, A052893, A053492, A277996, A279944, A280000, A317652, A317655, A317656, A317676.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A052893
|
|
Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.
|
|
+0
23
|
|
|
1, 1, 3, 10, 37, 144, 589, 2483, 10746, 47420, 212668, 966324, 4439540, 20587286, 96237484, 453012296, 2145478716, 10215922013, 48877938369, 234862013473, 1132902329028, 5483947191651, 26630419098206, 129696204701807, 633339363924611, 3100369991303297
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Number of free pure symmetric multifunctions with n + 1 unlabeled leaves. A free pure symmetric multifunction f in PSM is either (case 1) f = the leaf symbol "o", or (case 2) f = an expression of the form h[g_1, ..., g_k] where k > 0, h is in PSM, each of the g_i for i = 1, ..., k is in PSM, and for i < j we have g_i <= g_j under a canonical total ordering of PSM, such as the Mathematica ordering of expressions. - Gus Wiseman, Aug 02 2018
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(3) = 10 free pure symmetric multifunctions with 4 unlabeled leaves:
o[o[o[o]]]
o[o[o][o]]
o[o][o[o]]
o[o[o]][o]
o[o][o][o]
o[o[o,o]]
o[o,o[o]]
o[o][o,o]
o[o,o][o]
o[o,o,o]
(End)
|
|
MAPLE
|
spec := [S, {C = Set(B, 1 <= card), B=Prod(Z, S), S=Sequence(C)}, unlabeled]:
seq(combstruct[count](spec, size=n), n=0..20);
|
|
MATHEMATICA
|
multing[t_, n_]:=Array[(t+#-1)/#&, n, 1, Times];
a[n_]:=a[n]=If[n==1, 1, Sum[a[k]*Sum[Product[multing[a[First[s]], Length[s]], {s, Split[p]}], {p, IntegerPartitions[n-k]}], {k, 1, n-1}]];
|
|
PROG
|
(PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
seq(n)={my(v=[1]); for(n=1, n, v=Vec(1/(1-x*Ser(EulerT(v))))); v} \\ Andrew Howroyd, Aug 09 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A318151
|
|
e-numbers of unlabeled rooted trees with empty leaves o[] allowed. A number n is in the sequence iff n = 2^(prime(y_1) * ... * prime(y_k)) for some k >= 0 and y_1, ..., y_k already in the sequence.
|
|
+0
1
|
|
|
1, 2, 4, 8, 16, 64, 128, 256, 512, 4096, 16384, 65536, 262144, 524288, 2097152, 16777216, 134217728, 268435456, 4294967296, 68719476736, 274877906944, 4398046511104, 281474976710656, 562949953421312, 9007199254740992, 18014398509481984, 72057594037927936
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
If n = 1 let e(n) be the leaf symbol "o". Given a positive integer n > 1 we construct a unique orderless expression e(n) (as can be represented in functional programming languages such as Mathematica) with one atom by expressing n as a power of a number that is not a perfect power to a product of prime numbers: n = rad(x)^(prime(y_1) * ... * prime(y_k)) where rad = A007916. Then e(n) = e(x)[e(y_1), ..., e(y_k)]. For example, e(21025) = o[o[o]][o] because 21025 = rad(rad(1)^prime(rad(1)^prime(1)))^prime(1). The sequence consists of all numbers n such that e(n) contains no subexpressions in heads f[x_1, ..., x_k][y_1, ..., y_k] where k,j >= 0.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A317883
|
|
Number of free pure achiral multifunctions with one atom and n positions.
|
|
+0
6
|
|
|
1, 0, 1, 1, 3, 4, 10, 17, 37, 70, 150, 299, 634, 1311, 2786, 5879, 12584, 26904, 58005, 125242, 271819, 591297, 1290976, 2825170, 6199964, 13635749, 30057649, 66386206, 146903289, 325637240, 723024160, 1607805207, 3580476340, 7984266625, 17827226469
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
A free pure achiral multifunction (PAM) is either (case 1) the leaf symbol "o", or (case 2) a nonempty expression of the form h[g, ..., g] where h and g are PAMs. The number of positions in a PAM is the number of brackets [...] plus the number of o's.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1; a(n > 1) = Sum_{0 < k < n - 1} a(k) * Sum_{d|(n - k - 1)} a(d).
G.f. A(x) satisfies: A(x) = x * (1 + A(x) * Sum_{k>=1} A(x^k)). - Ilya Gutkovskiy, May 03 2019
|
|
EXAMPLE
|
The a(7) = 10 PAMs:
o[o[o[o]]]
o[o[o][o]]
o[o][o[o]]
o[o[o]][o]
o[o][o][o]
o[o[o,o,o]]
o[o][o,o,o]
o[o,o][o,o]
o[o,o,o][o]
o[o,o,o,o,o]
|
|
MATHEMATICA
|
a[n_]:=If[n==1, 1, Sum[a[k]*Sum[a[d], {d, Divisors[n-k-1]}], {k, n-2}]];
Array[a, 12]
|
|
PROG
|
(PARI) seq(n)={my(p=O(x)); for(n=1, n, p = x + p*x*sum(k=1, n-2, subst(p + O(x^(n\k+1)), x, x^k) ) + O(x*x^n)); Vec(p)} \\ Andrew Howroyd, Aug 19 2018
(PARI) seq(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, v[n]=sum(i=1, n-2, v[i]*sumdiv(n-i-1, d, v[d]))); v} \\ Andrew Howroyd, Aug 19 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A317876
|
|
Number of free pure symmetric identity multifunctions (with empty expressions allowed) with one atom and n positions.
|
|
+0
8
|
|
|
1, 1, 2, 4, 10, 25, 67, 184, 519, 1489, 4342, 12812, 38207, 114934, 348397, 1063050, 3262588, 10064645, 31190985, 97061431, 303165207, 950115502, 2986817742, 9415920424, 29760442192, 94286758293, 299377379027, 952521579944, 3036380284111, 9696325863803
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
A free pure symmetric identity multifunction (with empty expressions allowed) (FOI) is either (case 1) the leaf symbol "o", or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where h is an FOI, each of the g_i for i = 1, ..., k >= 0 is an FOI, and for i < j we have g_i < g_j under a canonical total ordering such as the Mathematica ordering of expressions. The number of positions in an FOI is the number of brackets [...] plus the number of o's.
Also the number of free orderless identity Mathematica expressions with one atom and n positions.
|
|
LINKS
|
|
|
FORMULA
|
G.f. A(x) satisfies: A(x) = x * (1 + A(x) * exp(Sum_{k>=1} (-1)^(k+1)*A(x^k)/k)).
G.f.: A(x) = Sum_{n>=1} a(n)*x^n = x * (1 + (Sum_{n>=1} a(n)*x^n) * Product_{n>=1} (1 + x^n)^a(n)). (End)
|
|
EXAMPLE
|
The a(5) = 10 FOIs:
o[o[o]]
o[o][o]
o[o[][]]
o[o,o[]]
o[][o[]]
o[][][o]
o[o[]][]
o[][o][]
o[o][][]
o[][][][]
|
|
MATHEMATICA
|
allIdExpr[n_]:=If[n==1, {"o"}, Join@@Cases[Table[PR[k, n-k-1], {k, n-1}], PR[h_, g_]:>Join@@Table[Apply@@@Tuples[{allIdExpr[h], Select[Union[Sort/@Tuples[allIdExpr/@p]], UnsameQ@@#&]}], {p, IntegerPartitions[g]}]]];
Table[Length[allIdExpr[n]], {n, 12}]
|
|
PROG
|
(PARI) WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, (-1)^(n-1)/n))))-1, -#v)}
seq(n)={my(v=[1]); for(n=2, n, my(t=WeighT(v)); v=concat(v, v[n-1] + sum(k=1, n-2, v[k]*t[n-k-1]))); v} \\ Andrew Howroyd, Aug 19 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A317875
|
|
Number of achiral free pure multifunctions with n unlabeled leaves.
|
|
+0
13
|
|
|
1, 1, 3, 9, 30, 102, 369, 1362, 5181, 20064, 79035, 315366, 1272789, 5185080, 21296196, 88083993, 366584253, 1533953100, 6449904138, 27238006971, 115475933202, 491293053093, 2096930378415, 8976370298886, 38528771056425, 165784567505325
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
An achiral free pure multifunction is either (case 1) the leaf symbol "o", or (case 2) a nonempty expression of the form h[g, ..., g], where h and g are both achiral free pure multifunctions.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1; a(n > 1) = Sum_{0 < k < n} a(n - k) * Sum_{d|k} a(d).
G.f. A(x) satisfies: A(x) = x + A(x) * Sum_{k>=1} A(x^k).
G.f.: A(x) = Sum_{n>=1} a(n)*x^n = x + (Sum_{n>=1} a(n)*x^n) * (Sum_{n>=1} a(n)*x^n/(1 - x^n)). (End)
|
|
EXAMPLE
|
The first 4 terms count the following multifunctions.
o,
o[o],
o[o,o], o[o[o]], o[o][o],
o[o,o,o], o[o[o][o]], o[o[o[o]]], o[o[o,o]], o[o][o,o], o[o][o[o]], o[o][o][o], o[o,o][o], o[o[o]][o].
|
|
MATHEMATICA
|
a[n_]:=If[n==1, 1, Sum[a[n-k]*Sum[a[d], {d, Divisors[k]}], {k, n-1}]];
Array[a, 12]
|
|
PROG
|
(PARI) seq(n)={my(p=O(x)); for(n=1, n, p = x + p*(sum(k=1, n-1, subst(p + O(x^(n\k+1)), x, x^k)) ) + O(x*x^n)); Vec(p)} \\ Andrew Howroyd, Aug 19 2018
(PARI) seq(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, v[n]=sum(i=1, n-1, v[i]*sumdiv(n-i, d, v[d]))); v} \\ Andrew Howroyd, Aug 19 2018
|
|
CROSSREFS
|
Cf. A001003, A001678, A002033, A003238, A052893, A053492, A067824, A167865, A214577, A277996, A280000, A317853.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.018 seconds
|