cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A069588 Smallest prime in which the n-th significant digit is a 1.

This page as a plain text file.
%I A069588 #17 Jun 23 2024 22:07:52
%S A069588 11,11,101,1009,10007,100003,1000003,10000019,100000007,1000000007,
%T A069588 10000000019,100000000003,1000000000039,10000000000037,
%U A069588 100000000000031,1000000000000037,10000000000000061,100000000000000003,1000000000000000003,10000000000000000051
%N A069588 Smallest prime in which the n-th significant digit is a 1.
%C A069588 Essentially (i.e., except for the initial term), the same as A003617. The definition is misleading, since "n-th significant digit" seems to mean here "most significant digit" (except for a(1)), while the "significance" is decreasing when going from the first to the last digit. (E.g., 1234 rounded to 2 significant digits is 1200, so "1,2" should be the first and second (and not fourth and third) significant digits.) [_M. F. Hasler_, Jun 03 2009]
%H A069588 Michael S. Branicky, <a href="/A069588/b069588.txt">Table of n, a(n) for n = 1..1000</a>
%p A069588 11,seq(nextprime(10^j),j=1..30);
%t A069588 Join[{11}, NextPrime[10^Range[20]]] (* _Paolo Xausa_, Jun 23 2024 *)
%o A069588 (Python)
%o A069588 from sympy import nextprime
%o A069588 def a(n): return 11 if n == 1 else nextprime(10**(n-1))
%o A069588 print([a(n) for n in range(1, 21)]) # _Michael S. Branicky_, Nov 11 2021
%K A069588 nonn,base
%O A069588 1,1
%A A069588 _Amarnath Murthy_, Mar 25 2002
%E A069588 More terms from _Sascha Kurz_, Mar 28 2002
%E A069588 a(19) and beyond from _Michael S. Branicky_, Nov 11 2021