Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102023
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102023 Indices of primes in sequence defined by A(0) = 13, A(n) = 10*A(n-1) + 33 for n > 0. +0
1
0, 1, 2, 17, 176, 323, 387, 391, 403, 530, 1082 (list; graph; listen)
OFFSET

1,3

COMMENT

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

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

Numbers corresponding to terms <= 530 are certified primes.

REFERENCES

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

EXAMPLE

163 is prime, hence 1 is a term.

PROGRAM

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

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

CROSSREFS

Cf. A000533, A002275.

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

Sequence in context: A046909 A041879 A011550 this_sequence A058010 A126752 A004029

Adjacent sequences: A102020 A102021 A102022 this_sequence A102024 A102025 A102026

KEYWORD

nonn,hard,more

AUTHOR

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

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research