|
Search: id:A101830
|
|
|
| A101830 |
|
Indices of primes in sequence defined by A(0) = 37, A(n) = 10*A(n-1) - 43 for n > 0. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Numbers n such that (290*10^n + 43)/9 is prime.
Numbers n such that digit 3 followed by n >= 0 occurrences of digit 2 followed by digit 7 is prime.
Number corresponding to term 41 is a certified prime. No further terms up to 5000.
|
|
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
|
37 is prime, hence 0 is a term.
|
|
PROGRAM
|
(PARI) a=37; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a-43)
(PARI) for(n=0, 1500, if(isprime((290*10^n+43)/9), print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A000533, A002275.
a(n) = A102967(n) - 1.
Sequence in context: A107690 A068815 A093174 this_sequence A091758 A104301 A106203
Adjacent sequences: A101827 A101828 A101829 this_sequence A101831 A101832 A101833
|
|
KEYWORD
|
nonn,bref,hard,more
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 20 2004
|
|
EXTENSIONS
|
5021 from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
|
|
|
Search completed in 0.002 seconds
|
