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!)
A341881 Number of ordered factorizations of n into 5 factors > 1. 3
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 0, 0, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
32,17
LINKS
Eric Weisstein's World of Mathematics, Ordered Factorization
FORMULA
Dirichlet g.f.: (zeta(s) - 1)^5.
a(n) = -10 * A000005(n) + 10 * A007425(n) - 5 * A007426(n) + A061200(n) + 5 for n > 1.
MAPLE
b:= proc(n) option remember; series(x*(1+add(b(n/d),
d=numtheory[divisors](n) minus {1, n})), x, 6)
end:
a:= n-> coeff(b(n), x, 5):
seq(a(n), n=32..128); # Alois P. Heinz, Feb 22 2021
MATHEMATICA
b[n_] := b[n] = Series[x*(1 + Sum[b[n/d],
{d, Divisors[n] ~Complement~ {1, n}}]), {x, 0, 6}];
a[n_] := Coefficient[b[n], x, 5];
Table[a[n], {n, 32, 128}] (* Jean-François Alcover, Feb 28 2022, after Alois P. Heinz *)
CROSSREFS
Column k=5 of A251683.
Sequence in context: A241471 A152623 A020761 * A281462 A236239 A047752
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 22 2021
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 July 19 03:15 EDT 2024. Contains 374388 sequences. (Running on oeis4.)