login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101723 Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 21 for n > 0. 0
0, 1, 3, 6, 9, 11, 19, 23, 29, 41, 61, 187, 303, 339, 714, 803, 1039, 1886, 2078, 2119, 2259, 2422, 3318, 5597, 6071 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Numbers n such that (390*10^n - 21)/9 is prime.

Numbers n such that digit 4 followed by n >= 0 occurrences of digit 3 followed by digit 1 is prime.

Numbers corresponding to terms <= 803 are certified primes.

REFERENCES

Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467.

LINKS

Table of n, a(n) for n=1..25.

Makoto Kamada, Factorizations of near-repdigit numbers.

EXAMPLE

431 is prime, hence 1 is a term.

PROG

(PARI) a=41; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a+21)

(PARI) for(n=0, 1500, if(isprime((390*10^n-21)/9), print1(n, ", ")))

CROSSREFS

Cf. A000533, A002275.

a(n) = A102988(n) - 1.

Sequence in context: A145283 A177800 A169924 * A113944 A198514 A103695

Adjacent sequences:  A101720 A101721 A101722 * A101724 A101725 A101726

KEYWORD

nonn,hard,more

AUTHOR

Klaus Brockhaus and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 14 2004

EXTENSIONS

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 02:47 EDT 2013. Contains 225428 sequences.