|
Search: id:A101715
|
|
|
| A101715 |
|
Indices of primes in sequence defined by A(0) = 49, A(n) = 10*A(n-1) - 81 for n > 0. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Numbers n such that 40*10^n + 9 is prime.
Numbers n such that digit 4 followed by n >= 0 occurrences of digit 0 followed by digit 9 is prime.
Numbers corresponding to terms <= 195 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
|
40009 is prime, hence 3 is a term.
|
|
PROGRAM
|
(PARI) a=49; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a-81)
(PARI) for(n=0, 1500, if(isprime(40*10^n+9), print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A000533, A002275.
a(n) = A101394(n) - 1.
Sequence in context: A050069 A117587 A130420 this_sequence A075773 A087276 A138225
Adjacent sequences: A101712 A101713 A101714 this_sequence A101716 A101717 A101718
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 14 2004
|
|
EXTENSIONS
|
2037 from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
|
|
|
Search completed in 0.002 seconds
|
