login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306657 Least primary Carmichael number (A324316) with n prime factors. 1
1729, 10606681, 4872420815346001 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
COMMENTS
Primary Carmichael numbers were introduced in Kellner and Sondow 2019. For this sequence, see Kellner 2019.
Conjecture: the sequence is infinite.
LINKS
Bernd C. Kellner and Jonathan Sondow, Power-Sum Denominators, Amer. Math. Monthly, 124 (2017), 695-709; arXiv:1705.03857 [math.NT], 2017.
Bernd C. Kellner and Jonathan Sondow, On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-p digits, Integers 21 (2021), #A52, 21 pp.; arXiv:1902.10672 [math.NT], 2019.
Bernd C. Kellner, On primary Carmichael numbers, Integers 22 (2022), #A38, 39 pp.; arXiv:1902.11283 [math.NT], 2019.
EXAMPLE
1729 = 7 * 13 * 19,
10606681 = 31 * 43 * 73 * 109,
4872420815346001 = 211 * 239 * 379 * 10711 * 23801.
CROSSREFS
Least Carmichael number with n prime factors is A006931.
Cf. also A002997, A324316.
Sequence in context: A277366 A050794 A138130 * A048949 A339909 A339878
KEYWORD
nonn,hard,more
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)