Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101150 Indices of primes in sequence defined by A(0) = 79, A(n) = 10*A(n-1) - 21 for n > 0. +0
1
0, 1, 2, 5, 7, 17, 18, 20, 31, 47, 64, 71, 98, 119, 200, 307, 716, 967, 1343, 2131, 3566, 3967, 8326, 10597, 12464, 15874, 18894 (list; graph; listen)
OFFSET

1,3

COMMENT

Numbers n such that (690*10^n + 21)/9 is prime.

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

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

7669 is prime, hence 2 is a term.

PROGRAM

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

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

CROSSREFS

Cf. A000533, A002275.

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

Sequence in context: A089727 A113514 A067161 this_sequence A038875 A019334 A045356

Adjacent sequences: A101147 A101148 A101149 this_sequence A101151 A101152 A101153

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research