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!)
A341882 Number of ordered factorizations of n into 6 factors > 1. 3
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
64,33
LINKS
Eric Weisstein's World of Mathematics, Ordered Factorization
FORMULA
Dirichlet g.f.: (zeta(s) - 1)^6.
a(n) = 15 * A000005(n) - 20 * A007425(n) + 15 * A007426(n) - 6 * A061200(n) + A034695(n) - 6 for n > 1.
MAPLE
b:= proc(n) option remember; series(x*(1+add(b(n/d),
d=numtheory[divisors](n) minus {1, n})), x, 7)
end:
a:= n-> coeff(b(n), x, 6):
seq(a(n), n=64..160); # 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, 7}];
a[n_] := Coefficient[b[n], x, 6];
Table[a[n], {n, 64, 160}] (* Jean-François Alcover, Feb 28 2022, after Alois P. Heinz *)
CROSSREFS
Column k=6 of A251683.
Sequence in context: A273941 A067483 A186685 * A307382 A339629 A331428
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 May 15 17:02 EDT 2024. Contains 372548 sequences. (Running on oeis4.)