The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A305049 Expansion of 1/(1 - Sum_{k>=1} tau_k(k)*x^k), where tau_k(k) = number of ordered k-factorizations of k (A163767). 0
1, 1, 3, 8, 27, 67, 216, 569, 1747, 4812, 14041, 39483, 115408, 326385, 941735, 2684170, 7725097, 22063737, 63354066, 181223899, 519883185, 1488316952, 4266788191, 12219763777, 35023995792, 100326757107, 287503501905, 823654031283, 2360146144917, 6761847714698, 19374935267810 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Invert transform of A163767.
LINKS
N. J. A. Sloane, Transforms
FORMULA
G.f.: 1/(1 - Sum_{k>=1} A163767(k)*x^k).
MAPLE
A:= proc(n, k) option remember; `if`(k=1, 1,
add(A(d, k-1), d=numtheory[divisors](n)))
end:
a:= proc(n) option remember; `if`(n=0, 1,
add(A(j$2)*a(n-j), j=1..n))
end:
seq(a(n), n=0..35); # Alois P. Heinz, May 24 2018
MATHEMATICA
nmax = 30; CoefficientList[Series[1/(1 - Sum[Times @@ (Binomial[# + k - 1, k - 1] & /@ FactorInteger[k][[All, 2]]) x^k, {k, 1, nmax}]), {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = Sum[Times @@ (Binomial[# + k - 1, k - 1] & /@ FactorInteger[k][[All, 2]]) a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 30}]
CROSSREFS
Sequence in context: A066018 A066023 A347830 * A332833 A148823 A205503
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, May 24 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 13:10 EDT 2024. Contains 373098 sequences. (Running on oeis4.)