This site is supported by donations to The OEIS Foundation.

 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; text; internal format)
 OFFSET 1,4 LINKS FORMULA Dirichlet g.f.: prod{n is in A000069}(1/(1-1/n^s)). CROSSREFS Cf. A116488, A116490. Sequence in context: A258850 A182114 A122950 * A166373 A202451 A238727 Adjacent sequences:  A116486 A116487 A116488 * A116490 A116491 A116492 KEYWORD nonn AUTHOR Christian G. Bower, Feb 17 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 16 13:51 EDT 2019. Contains 328093 sequences. (Running on oeis4.)