[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A088325 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Piet Hut's "coat-hanger" sequence: unlabeled forests of rooted trees with n edges, where there can be any number of components, the outdegree of each node is <= 2 and the symmetric group acts on the components.
(history; published version)
#17 by Susanna Cuyler at Wed Sep 08 21:51:34 EDT 2021
STATUS

proposed

approved

#16 by Michael De Vlieger at Wed Sep 08 15:40:43 EDT 2021
STATUS

editing

proposed

#15 by Michael De Vlieger at Wed Sep 08 15:40:42 EDT 2021
LINKS

Eunjeong Lee, Mikiya Masuda, and Seonjeong Park, <a href="https://arxiv.org/abs/2105.12274">Toric Richardson varieties of Catalan type and Wedderburn-Etherington numbers</a>, arXiv:2105.12274 [math.AG], 2021.

STATUS

approved

editing

#14 by Bruno Berselli at Mon Jun 11 03:19:34 EDT 2018
STATUS

proposed

approved

#13 by Jean-François Alcover at Mon Jun 11 02:30:01 EDT 2018
STATUS

editing

proposed

#12 by Jean-François Alcover at Mon Jun 11 02:29:52 EDT 2018
MATHEMATICA

b[n_] := b[n] = If[n<2, n, If[OddQ[n], 0, Function[t, t*(1-t)/2][b[n/2]]] + Sum[b[i]*b[n-i], {i, 1, n/2}]];

a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d*b[d+1], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n];

Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Jun 11 2018, after Alois P. Heinz *)

STATUS

approved

editing

#11 by Alois P. Heinz at Mon Sep 11 12:02:23 EDT 2017
STATUS

editing

approved

#10 by Alois P. Heinz at Mon Sep 11 12:02:18 EDT 2017
FORMULA

G.f.: exp(Sum_{k>=1) } B(x^k)/k), where B(x) = x + x^2 + 2*x^3 + 3*x^4 + 6*x^5 + 11*x^6 + ... = G001190(x)/x - 1 and G001190 is the g.f. for the Wedderburn-Etherington numbers A001190. - N. J. A. Sloane.

STATUS

approved

editing

#9 by Alois P. Heinz at Mon Sep 11 11:58:02 EDT 2017
STATUS

editing

approved

#8 by Alois P. Heinz at Mon Sep 11 10:52:44 EDT 2017
LINKS

Alois P. Heinz, <a href="/A088325/b088325.txt">Table of n, a(n) for n = 0..2542</a>

MAPLE

b:= proc(n) option remember; `if`(n<2, n, `if`(n::odd, 0,

(t-> t*(1-t)/2)(b(n/2)))+add(b(i)*b(n-i), i=1..n/2))

end:

a:= proc(n) option remember; `if`(n=0, 1, add(add(d*b(d+1),

d=numtheory[divisors](j))*a(n-j), j=1..n)/n)

end:

seq(a(n), n=0..40); # Alois P. Heinz, Sep 11 2017