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.

A092767 Numbers k such that 10^k - 11 is prime.

This page as a plain text file.
%I A092767 #34 Apr 29 2024 09:31:09
%S A092767 2,5,8,12,15,18,20,30,80,143,152,164,176,239,291,324,504,594,983,2894,
%T A092767 22226,35371,58437,67863,180979
%N A092767 Numbers k such that 10^k - 11 is prime.
%C A092767 Some of the larger terms may only correspond to probable primes.
%C A092767 The numbers corresponding to k = 324, 504, 594 & 983 are certified prime by Primo. - _Robert G. Wilson v_, Jul 01 2005
%C A092767 a(26) > 2.5*10^5. - _Robert Price_, Apr 12 2015
%H A092767 Makoto Kamada, <a href="https://stdkmd.net/nrr/aaaba.htm">Near-repdigit numbers of the form AA...AABA</a>.
%H A092767 Makoto Kamada, <a href="https://stdkmd.net/nrr/9/99989.htm#prime">Prime numbers of the form 99...9989</a>.
%H A092767 <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>.
%e A092767 k = 5 is a term because 10^5 - 11 = 100000 - 11 = 99989, which is prime.
%t A092767 Do[ If[ PrimeQ[10^n - 11], Print[n]], {n, 3000}] (* _Robert G. Wilson v_, Jul 01 2005 *)
%o A092767 (PARI) for(n=0,5000,if(isprime(10^n-11),print1(n,","))) \\ _Ryan Propper_, Jun 15 2005
%Y A092767 Cf. A089675, A086865, A004023, A095714.
%K A092767 more,nonn
%O A092767 1,1
%A A092767 _Carl R. White_, Apr 23 2004
%E A092767 4 more terms from _Ryan Propper_, Jun 15 2005
%E A092767 Edited by _N. J. A. Sloane_, May 04 2007
%E A092767 a(21)-a(22) from _Robert Price_, Dec 12 2010
%E A092767 Edited by _Ray Chandler_, Dec 23 2010
%E A092767 a(23)=58437 and a(24)=67863 from _Robert Price_, May 29 2011
%E A092767 a(25) from Kamada data by _Robert Price_, Apr 12 2015