|
|
A185201
|
|
10^n - second largest prime less than 10^n.
|
|
1
|
|
|
5, 11, 9, 33, 11, 21, 27, 29, 71, 57, 53, 39, 137, 29, 53, 83, 23, 33, 57, 27, 113, 71, 53, 303, 321, 249, 107, 261, 53, 17, 81, 119, 47, 513, 237, 179, 123, 123, 173, 27, 203, 137, 119, 77, 119, 147, 83, 47, 183, 161, 333, 339, 611, 579
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Second Edition, Vol. 2, Seminumerical Algorithms, Chapter 4.5.4 Factoring into Primes, Table 1, Page 390, Addison-Wesley, Reading, MA, 1981.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 10^n - precprime(precprime(10^n)-1)
|
|
EXAMPLE
|
a(1)=5 because precprime(10)=7, and precprime(6)=5.
|
|
MAPLE
|
seq(10^n - prevprime(prevprime(10^n)), n=1..100); # Robert Israel, May 28 2017
|
|
MATHEMATICA
|
Table[10^n - NextPrime[10^n, -2], {n, 1, 50}] (* G. C. Greubel, Jun 24 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|