Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101137
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101137 Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) + 21 for n > 0. +0
1
0, 2, 3, 4, 5, 8, 11, 30, 58, 68, 73, 286, 488, 591, 633, 1088, 1606, 3140, 5961, 6266, 9677, 11430, 12926 (list; graph; listen)
OFFSET

1,2

COMMENT

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

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

Numbers corresponding to terms <= 633 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

7333331 is prime, hence 5 is a term.

PROGRAM

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

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

CROSSREFS

Cf. A000533, A002275.

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

Sequence in context: A078762 A103262 A135318 this_sequence A053021 A122700 A048486

Adjacent sequences: A101134 A101135 A101136 this_sequence A101138 A101139 A101140

KEYWORD

nonn,hard,more

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 03 2004

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research