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.

A101128 Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) - 9 for n > 0.

This page as a plain text file.
%I A101128 #12 Jan 17 2019 13:44:06
%S A101128 0,1,2,3,4,7,8,44,135,141,157,242,922,1234,2195,4649,6118,7323,9542,
%T A101128 13493,20309,20359,232919,830864,902707
%N A101128 Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) - 9 for n > 0.
%C A101128 Numbers n such that 70*10^n + 1 is prime.
%C A101128 Numbers n such that digit 7 followed by n >= 0 occurrences of digit 0 followed by digit 1 is prime.
%C A101128 Numbers corresponding to terms <= 922 are certified primes.
%D A101128 Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467.
%H A101128 Makoto Kamada, <a href="https://stdkmd.net/nrr/7/70001.htm#prime">Prime numbers of the form 700...001</a>.
%H A101128 <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>.
%F A101128 a(n) = A056804(n) - 1.
%e A101128 700001 is prime, hence 4 is a term.
%o A101128 (PARI) a=71;for(n=0,1500,if(isprime(a),print1(n,","));a=10*a-9)
%o A101128 (PARI) for(n=0,1500,if(isprime(70*10^n+1),print1(n,",")))
%Y A101128 Cf. A000533, A002275, A056804.
%K A101128 nonn,hard,more
%O A101128 1,3
%A A101128 _Klaus Brockhaus_ and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 03 2004
%E A101128 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 01 2008
%E A101128 a(21)-a(25) from Kamada data by _Ray Chandler_, Apr 29 2015