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

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

Offset: 1

Author

Artur Jasinski, Nov 25 2007

Keywords

• nonn

Comments

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

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A002997, A006931.

Formula

a(n) = A001221(A002997(n)). - M. F. Hasler, Apr 14 2015