The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063400 Largest n-digit Carmichael numbers. 1
 561, 8911, 75361, 997633, 9890881, 99861985, 993905641, 9999109081, 99976607641, 999629786233, 9999501351841, 99994742993377, 999922265173441, 9999924433632001, 99999201310035841, 999996386511276505, 9999998594193164041 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 LINKS EXAMPLE a(4)=8911 because 8911 is the largest 4-digit Carmichael number. [corrected by Jon E. Schoenfield, Jan 28 2014] MATHEMATICA CarmichaelNbrQ[n_] := !PrimeQ[n] && Mod[n, CarmichaelLambda[n]] == 1; f[n_] := f[n] = Block[{k = 10^n - 1}, While[!CarmichaelNbrQ[k], k -= 2]; k]; Reap[Do[Print[{n, f[n]}]; Sow[f[n]], {n, 3, 10}]][[2, 1]] (* Jean-François Alcover, Jan 28 2014, after Shyam Sunder Gupta *) CROSSREFS Cf. A062568, A062852, A048123. Sequence in context: A207080 A339875 A290945 * A141706 A290485 A213071 Adjacent sequences:  A063397 A063398 A063399 * A063401 A063402 A063403 KEYWORD hard,more,nonn,base AUTHOR Shyam Sunder Gupta, Feb 17 2002 EXTENSIONS a(17)-a(19) 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 16:44 EST 2021. Contains 349430 sequences. (Running on oeis4.)