login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116489 Number of factorizations of n into odious numbers > 1. 2
1, 1, 0, 2, 0, 0, 1, 3, 0, 0, 1, 0, 1, 2, 0, 5, 0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 4, 0, 0, 1, 7, 0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 4, 0, 0, 1, 0, 2, 2, 0, 4, 0, 0, 1, 7, 0, 0, 1, 0, 1, 2, 0, 11, 0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 4, 1, 0, 1, 0, 1, 2, 0, 4, 0, 0, 1, 7, 0, 0, 2, 0, 1, 2, 0, 0, 1, 4, 0, 4, 0, 0, 1, 7 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

Dirichlet g.f.: prod{n is in A000069}(1/(1-1/n^s)).

CROSSREFS

Cf. A116488, A116490.

Sequence in context: A051510 A153036 A122950 * A166373 A202451 A056885

Adjacent sequences:  A116486 A116487 A116488 * A116490 A116491 A116492

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Feb 17 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:13 EST 2012. Contains 205991 sequences.