Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156150 Primes p such that p+2 = 0 (mod pi(p)) and pi(p)=A000720(p) is prime. +0
2
31, 353, 9559783, 9559903 (list; graph; listen)
OFFSET

1,1

COMMENT

A subsequence of A156151.

FORMULA

a(n) = A000040(A156149(n))

PROGRAM

(PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( p", "))

CROSSREFS

Cf. A156153.

Sequence in context: A111675 A142495 A100728 this_sequence A125419 A138440 A161347

Adjacent sequences: A156147 A156148 A156149 this_sequence A156151 A156152 A156153

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 20 13:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research