login
A174617
Number of nine-prime Carmichael numbers less than 10^n.
10
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 27, 170, 1436, 8835, 44993, 196391, 762963, 2714473, 8939435, 27660029, 81041495
OFFSET
0,15
REFERENCES
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag, NY, 2004. See p. 220.
LINKS
R. G. E. Pinch, The Carmichael numbers up to 10^21, Proceedings of Conference on Algorithmic Number Theory 2007.
R. G. E. Pinch, The Carmichael numbers up to 10^21, Poster, Proceedings of Conference on Algorithmic Number Theory 2007.
Andrew Shallue and Jonathan Webster, Algorithms for Carmichael numbers, arXiv:2506.09903 [math.NT], 2025-2026.
EXAMPLE
The smallest Carmichael number with 9 prime factors is 9746347772161 = 7*11*13*17*19*31*37*41*641, so a(13)=1..
CROSSREFS
For k-prime Carmichael numbers up to 10^n for k = 3,4,...,11, see A132195, A174612, A174613, A174614, A174615, A174616, A174617, A299710, A299711.
Sequence in context: A372560 A213285 A372444 * A055339 A269054 A395908
KEYWORD
nonn,more
AUTHOR
Michel Lagneau, Mar 23 2010
EXTENSIONS
a(22) from Claude Goutier added by Amiram Eldar, Apr 19 2024
a(23)-a(24) from Shallue and Webster (2025-2026) added by Amiram Eldar, Jan 24 2026
STATUS
approved