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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A157036 Shorthand for A157035, the largest prime with 2^n digits. 3
 3, 3, 27, 11, 63, 21, 51, 17, 813, 377, 7017, 27381, 7763, 1133, 119387, 67347, 121877 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The actual prime A157035(n) is obtained as 10^(2^n) - a(n). LINKS Table of n, a(n) for n=0..16. FORMULA a(n) = 10^(2^n) - A157035(n). a(n) = A033874(2^n). MAPLE a:= n-> (t-> t-prevprime(t))(10^(2^n)): seq(a(n), n=0..10); # Alois P. Heinz, Mar 02 2022 PROG (PARI) { a(n) = 10^(2^n) - precprime(10^(2^n)) } \\ Max Alekseyev, Mar 28 2009 (Python) from sympy import prevprime def a(n): return 10**(2**n) - prevprime(10**(2**n)) print([a(n) for n in range(10)]) # Michael S. Branicky, Mar 02 2022 CROSSREFS Cf. A033874, A157034, A157035. Sequence in context: A363471 A303822 A326176 * A080302 A080272 A369013 Adjacent sequences: A157033 A157034 A157035 * A157037 A157038 A157039 KEYWORD nonn,base,more AUTHOR Lekraj Beedassy, Feb 22 2009 EXTENSIONS a(8)-a(13) from Ray Chandler and Max Alekseyev, Mar 22 2009 a(14) from Jinyuan Wang, Feb 22 2022 a(15) from Michael S. Branicky, Jun 19 2024 a(16) from Michael S. Branicky, Jun 27 2024 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.

Last modified August 12 10:37 EDT 2024. Contains 375092 sequences. (Running on oeis4.)