Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156153
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156153 Primes p such that p == 2 (mod pi(p)) and pi(p) is prime. +0
4
5, 41, 367, 9559817, 514275529 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = A000040(A156154(n)) = A000040(A000040(A156155(n)))

PROGRAM

(PARI) p=c=0; until(0, until( isprime(c++),

CROSSREFS

Cf. A156152.

Sequence in context: A155612 A145215 A083884 this_sequence A026000 A058475 A064087

Adjacent sequences: A156150 A156151 A156152 this_sequence A156154 A156155 A156156

KEYWORD

hard,more,nonn

AUTHOR

M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 04 2009

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