|
| |
|
|
A102011
|
|
Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 61 for n > 0.
|
|
1
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Numbers n such that (110*10^n + 61)/9 is prime.
Numbers n such that digit 1 followed by n >= 0 occurrences of digit 2 followed by digit 9 is prime.
Numbers corresponding to terms <= 546 are certified primes.
|
|
|
REFERENCES
| Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467.
|
|
|
EXAMPLE
| 1222229 is prime, hence 5 is a term.
|
|
|
PROG
| (PARI) a=19; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a-61)
(PARI) for(n=0, 1500, if(isprime((110*10^n+61)/9), print1(n, ", ")))
|
|
|
CROSSREFS
| Cf. A000533, A002275.
a(n) = A102931(n) - 1.
Sequence in context: A112266 A060808 A099658 * A004098 A005114 A081090
Adjacent sequences: A102008 A102009 A102010 * A102012 A102013 A102014
|
|
|
KEYWORD
| nonn,hard,more
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 28 2004
|
| |
|
|
