|
Search: id:A101146
|
|
|
| A101146 |
|
Indices of primes in sequence defined by A(0) = 79, A(n) = 10*A(n-1) - 31 for n > 0. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Numbers n such that (680*10^n + 31)/9 is prime.
Numbers n such that digit 7 followed by n >= 0 occurrences of digit 5 followed by digit 9 is prime.
Numbers corresponding to terms <= 966 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
|
79 is prime, hence 0 is a term.
|
|
PROGRAM
|
(PARI) a=79; for(n=0, 1000, if(isprime(a), print1(n, ", ")); a=10*a-31)
(PARI) for(n=0, 1000, if(isprime((680*10^n+31)/9), print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A000533, A002275.
a(n) = A103062(n) - 1.
Sequence in context: A057157 A139963 A124046 this_sequence A087226 A071967 A024348
Adjacent sequences: A101143 A101144 A101145 this_sequence A101147 A101148 A101149
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 03 2004
|
|
EXTENSIONS
|
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 01 2008
|
|
|
Search completed in 0.002 seconds
|
