Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156148
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156148 Numbers n such that prime(prime(n))+2 = 0 (mod prime(n)), where prime(p)=A000040(p) is the p-th prime. +0
2
5, 20, 51891, 51893 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = A000720(A156149(n))

PROGRAM

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

CROSSREFS

Cf. A156155.

Sequence in context: A032324 A032072 A002030 this_sequence A156824 A053002 A053003

Adjacent sequences: A156145 A156146 A156147 this_sequence A156149 A156150 A156151

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


AT&T Labs Research