reviewed
approved
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”).
reviewed
approved
proposed
reviewed
editing
proposed
b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0,
Sum[b[n-i*j, i-1]*Binomial[a[i]+j-1, j], {j, 0, n/i}]]];
a[n_] := If[n < 2, n, 1 + b[n, n-1]];
Array[a, 30] (* Jean-François Alcover, May 21 2021, after Alois P. Heinz *)
approved
editing
proposed
approved
editing
proposed
Klein, Moshe, and A. Yu Khrennikov. "Recursion over partitions." P-Adic Numbers, Ultrametric Analysis, and Applications 6.4 (2014): 303-309; http://www.hamataraemet.org/wp-content/uploads/2014/10/Recursion-over-partitions-4.10.2014.pdf. (See sp_n)
Moshe Klein and A. Yu Khrennikov, <a href="http://www.hamataraemet.org/wp-content/uploads/2014/10/Recursion-over-partitions-4.10.2014.pdf">Recursion over partitions</a, P-Adic Numbers, Ultrametric Analysis, and Applications 6.4 (2014): 303-309. See sp_n.
approved
editing
proposed
approved
editing
proposed
(PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
seq(n)={my(v=vector(n)); for(n=1, n, v[n]=1 + EulerT(v[1..n])[n]); v} \\ Andrew Howroyd, Oct 26 2018
approved
editing