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!)
A048123 Smallest n-digit Carmichael numbers. 1
561, 1105, 10585, 101101, 1024651, 10024561, 100427041, 1001152801, 10017089857, 100023777217, 1000151515441, 10000879761601, 100000782192961, 1000040508690301, 10000092861302401, 100001371359120001, 1000004296444433281, 10000011591390633121 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
LINKS
EXAMPLE
a(4)=1105 because 1105 is the smallest 4-digit Carmichael number. [corrected by Jon E. Schoenfield, Jan 28 2014]
MATHEMATICA
CarmichaelNbrQ[n_] := ! PrimeQ@ n && Mod[n, CarmichaelLambda@ n] == 1; f[n_] := Block[{k = 10^(n - 1) + 1}, While[! CarmichaelNbrQ@ k, k += 2]; k]; Do[ Print[{n, f[n] // Timing}], {n, 3, 18}]
CROSSREFS
Sequence in context: A262043 A264012 A175737 * A309268 A131672 A321156
KEYWORD
hard,more,nonn,base
AUTHOR
Shyam Sunder Gupta, Feb 17 2002
EXTENSIONS
a(17)-a(20) from Amiram Eldar, Jun 29 2019
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 23 07:42 EDT 2024. Contains 371905 sequences. (Running on oeis4.)