id:A028422 - OEIS Search Results

Search: id:A028422

Displaying 1-1 of 1 results found.

page 1

Number of ways n can be properly factored.

+0
15

0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 3, 0, 1, 1, 4, 0, 3, 0, 3, 1, 1, 0, 6, 1, 1, 2, 3, 0, 4, 0, 6, 1, 1, 1, 8, 0, 1, 1, 6, 0, 4, 0, 3, 3, 1, 0, 11, 1, 3, 1, 3, 0, 6, 1, 6, 1, 1, 0, 10, 0, 1, 3, 10, 1, 4, 0, 3, 1, 4, 0, 15, 0, 1, 3, 3, 1, 4, 0, 11, 4, 1, 0, 10, 1, 1, 1, 6, 0, 10 (list; graph; listen)

	OFFSET	`1,8`
	EXAMPLE	`12 can be expressed as 26, 34 or 223, so a(12)=3.`
	CROSSREFS	`A001055(n) - 1.` `Sequence in context: A114206 A073202 A055212 this_sequence A064577 A113949 A128589` `Adjacent sequences: A028419 A028420 A028421 this_sequence A028423 A028424 A028425`
	KEYWORD	`nonn`
	AUTHOR	`Glen Burch (gburch(AT)erols.com)`

page 1

Search completed in 0.002 seconds

Last modified September 5 17:15 EDT 2008. Contains 143476 sequences.

AT&T Labs Research