|
Search: id:A101719
|
|
|
| A101719 |
|
Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 11 for n > 0. |
|
+0
1
|
| |
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Numbers n such that (380*10^n - 11)/9 is prime.
Numbers n such that digit 4 followed by n >= 0 occurrences of digit 2 followed by digit 1 is prime.
Numbers corresponding to terms <= 79 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
|
421 is prime, hence 1 is a term.
|
|
PROGRAM
|
(PARI) a=41; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a+11)
(PARI) for(n=0, 1500, if(isprime((380*10^n-11)/9), print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A000533, A002275.
a(n) = A102984(n) - 1.
Sequence in context: A019042 A019052 A064366 this_sequence A101582 A069558 A050611
Adjacent sequences: A101716 A101717 A101718 this_sequence A101720 A101721 A101722
|
|
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
|
4426 from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
|
|
|
Search completed in 0.002 seconds
|
