id:A122810 - OEIS Search Results

Search: id:A122810

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of the smallest odd number with exactly n divisors.

+0
4

0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 3, 3, 1, 3, 1, 4, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 5, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 3, 5, 2, 3, 1, 3, 2, 3, 1, 5, 1, 2, 3, 3, 2, 3, 1, 5, 4, 2, 1, 4, 2, 2, 2, 4, 1, 4, 2, 3, 2, 2, 2, 5, 1, 3, 3, 4, 1, 3, 1, 4, 3 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n)=1 iff n is prime.`
	FORMULA	`a(n) = omega(A038457(n)), where omega(n) = A001221(n).`
	CROSSREFS	`Cf. A001221, A038457, A122375.` `Adjacent sequences: A122807 A122808 A122809 this_sequence A122811 A122812 A122813` `Sequence in context: A073811 A125030 A116479 this_sequence A086436 A001222 A098893`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 22 2006`

page 1

Search completed in 0.002 seconds

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research