Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101531
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101531 Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 41 for n > 0. +0
1
0, 2, 3, 9, 21, 39, 53, 80, 83, 105, 192, 596, 680, 1362, 1875, 4023 (list; graph; listen)
OFFSET

1,2

COMMENT

Numbers n such that (590*10^n - 41)/9 is prime.

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

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

65551 is prime, hence 3 is a term.

PROGRAM

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

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

CROSSREFS

Cf. A000533, A002275.

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

Sequence in context: A111189 A001004 A015951 this_sequence A099607 A077550 A056780

Adjacent sequences: A101528 A101529 A101530 this_sequence A101532 A101533 A101534

KEYWORD

nonn,hard,more

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 06 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research