login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135717 a(n) = number of prime divisors of Carmichael numbers A002997(n). 5
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Number of prime divisors is always >= 3. For least Carmichael number with n+2 divisors see A006931.

CROSSREFS

Cf. A002997, A006931.

Sequence in context: A053444 A130635 A175797 * A079083 A176171 A032568

Adjacent sequences:  A135714 A135715 A135716 * A135718 A135719 A135720

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Nov 25 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:46 EST 2012. Contains 205867 sequences.