id:A116489 - OEIS Search Results

Search: id:A116489

Displaying 1-1 of 1 results found.

page 1

Number of factorizations of n into odious numbers > 1.

+0
3

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; listen)

	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 this_sequence A166373 A056885 A029373` `Adjacent sequences: A116486 A116487 A116488 this_sequence A116490 A116491 A116492`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Feb 17 2006`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research