|
| |
|
|
A101955
|
|
Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 71 for n > 0.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Numbers n such that (190*10^n + 71)/9 is prime.
Numbers n such that digit 2 followed by n >= 0 occurrences of digit 1 followed by digit 9 is prime.
Numbers corresponding to terms <= 426 are certified primes.
|
|
|
REFERENCES
| Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467.
|
|
|
LINKS
| Makoto Kamada, Factorizations of near-repdigit numbers.
|
|
|
EXAMPLE
| 29 is prime, hence 0 is a term.
|
|
|
PROG
| (PARI) a=29; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a-71)
(PARI) for(n=0, 1500, if(isprime((190*10^n+71)/9), print1(n, ", ")))
|
|
|
CROSSREFS
| Cf. A000533, A002275.
a(n) = A102950(n) - 1.
Sequence in context: A078251 A092625 A043612 * A063352 A043499 A163653
Adjacent sequences: A101952 A101953 A101954 * A101956 A101957 A101958
|
|
|
KEYWORD
| nonn,hard,more
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 23 2004
|
|
|
EXTENSIONS
| More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
|
| |
|
|
