Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101962
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101962 Indices of primes in sequence defined by A(0) = 27, A(n) = 10*A(n-1) - 13 for n > 0. +0
1
1, 2, 25, 26, 44, 61, 146, 1276, 1664, 1978, 2969 (list; graph; listen)
OFFSET

1,2

COMMENT

Numbers n such that (230*10^n + 13)/9 is prime.

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

Numbers corresponding to terms <= 146 are certified primes.

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

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

2557 is prime, hence 2 is a term.

PROGRAM

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

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

CROSSREFS

Cf. A000533, A002275, A099006.

Sequence in context: A065665 A036502 A076449 this_sequence A092045 A054283 A041723

Adjacent sequences: A101959 A101960 A101961 this_sequence A101963 A101964 A101965

KEYWORD

nonn,hard,more

AUTHOR

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

EXTENSIONS

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 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