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!)
A280152 Expansion of Product_{k>=1} (1 + floor(1/omega(2*k+1))*x^(2*k+1)), where omega() is the number of distinct prime factors (A001221). 3
1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 3, 3, 3, 3, 4, 4, 5, 4, 6, 6, 6, 7, 7, 9, 8, 9, 10, 11, 12, 11, 14, 14, 16, 15, 18, 19, 19, 21, 22, 25, 25, 27, 28, 32, 32, 34, 36, 40, 41, 42, 47, 49, 52, 53, 57, 62, 63, 67, 71, 76, 79, 82, 88, 93, 98, 100, 108, 114, 118, 124 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,13
COMMENTS
Number of partitions of n into distinct odd prime powers (1 excluded).
LINKS
Eric Weisstein's World of Mathematics, Prime Power
FORMULA
G.f.: Product_{k>=1} (1 + floor(1/omega(2*k+1))*x^(2*k+1)).
EXAMPLE
a(16) = 3 because we have [13, 3], [11, 5], [9, 7].
MATHEMATICA
nmax = 78; CoefficientList[Series[Product[1 + Floor[1/PrimeNu[2 k + 1]] x^(2 k + 1), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A157235 A086289 A077807 * A281574 A191784 A261350
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Dec 27 2016
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:27 EDT 2024. Contains 371769 sequences. (Running on oeis4.)