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!)
A308063 Number of ordered factorizations of n into numbers with an odd number of distinct prime divisors. 2
1, 1, 1, 2, 1, 2, 1, 4, 2, 2, 1, 5, 1, 2, 2, 8, 1, 5, 1, 5, 2, 2, 1, 12, 2, 2, 4, 5, 1, 7, 1, 16, 2, 2, 2, 14, 1, 2, 2, 12, 1, 7, 1, 5, 5, 2, 1, 28, 2, 5, 2, 5, 1, 12, 2, 12, 2, 2, 1, 21, 1, 2, 5, 32, 2, 7, 1, 5, 2, 7, 1, 37, 1, 2, 5, 5, 2, 7, 1, 28, 8, 2, 1, 21, 2, 2, 2, 12, 1, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
G.f. A(x) satisfies: A(x) = x + Sum_{k>=1} A(x^A030230(k)).
a(1) = 1; a(n) = Sum_{d|n, d<n} A092248(n/d)*a(d).
a(n) = 1 if n is in A008578.
MATHEMATICA
terms = 90; A[_] = 0; Do[A[x_] = x + Sum[Boole[OddQ[PrimeNu[k]]] A[x^k], {k, 1, terms}] + O[x]^(terms + 1) // Normal, terms + 1]; Rest[CoefficientList[A[x], x]]
f[n_] := f[n] = Boole[OddQ[PrimeNu[n]]]; a[n_] := If[n == 1, n, Sum[If[d < n, f[n/d] a[d], 0], {d, Divisors[n]}]]; Table[a[n], {n, 1, 90}]
CROSSREFS
Sequence in context: A317545 A319002 A050363 * A166974 A292504 A281118
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, May 10 2019
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 April 18 08:14 EDT 2024. Contains 371769 sequences. (Running on oeis4.)