Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056247
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056247 Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 51 for n > 0. +0
1
0, 3, 11, 15, 17, 35, 51, 71, 99, 6231, 24027, 40221 (list; graph; listen)
OFFSET

1,2

COMMENT

Numbers n such that (150*10^n - 51)/9 is prime.

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

Numbers corresponding to terms <= 99 are certified primes.

a(n) = A082700(n-2) - 2 for n > 1.

REFERENCES

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

LINKS

Makoto Kamada, Factorizations of 166...661.

EXAMPLE

16661 is prime, hence 3 is a term.

PROGRAM

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

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

CROSSREFS

Cf. A000533, A002275, A082700.

Sequence in context: A132363 A134629 A030715 this_sequence A039275 A044971 A106374

Adjacent sequences: A056244 A056245 A056246 this_sequence A056248 A056249 A056250

KEYWORD

nonn,hard,more

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 18 2000

EXTENSIONS

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

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 15 2007

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research