id:A135717 - OEIS Search Results

Search: id:A135717

Displaying 1-1 of 1 results found.

page 1

a(n) = number of prime divisors of Carmichael numbers A002997(n).

+0
6

3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 3, 4, 3, 4, 4, 3, 4, 3, 3, 3, 4, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 4, 5, 4, 4, 4, 3, 4, 5, 4, 3, 3, 3, 4, 3, 4, 3, 3, 4, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 3, 4, 3, 3, 4, 4, 4, 4, 4, 3, 3, 4, 3, 3, 4, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 5 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Number of prime divisors is always >= 3. For least Carmichael number with n+2 divisors see A006931.`
	CROSSREFS	`Cf. A002997, A006931.` `Sequence in context: A087717 A053444 A130635 this_sequence A079083 A032568 A053388` `Adjacent sequences: A135714 A135715 A135716 this_sequence A135718 A135719 A135720`
	KEYWORD	`nonn`
	AUTHOR	`Artur Jasinski (grafix(AT)csl.pl), Nov 25 2007`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research