login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078655 a(n) = prime(k) where k = n-th prime congruent to 1 mod 6. 1
17, 41, 67, 127, 157, 191, 283, 331, 367, 401, 509, 563, 599, 709, 797, 877, 919, 967, 1087, 1171, 1217, 1297, 1409, 1447, 1523, 1741, 1787, 1847, 2027, 2081, 2221, 2269, 2351, 2477, 2549, 2609, 2719, 2803, 2909, 3019, 3067, 3229, 3299, 3469, 3559 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

PROG

(PARI) pip(n, m, r) = {sr=0; forprime(x=3, n, if(x%m == r, v=prime(x); sr+=1.0/v; print1(v" "); ) ); print(); print("m="m" r="r" sr="sr); }

CROSSREFS

Sequence in context: A104043 A076330 A087658 * A052279 A147215 A126790

Adjacent sequences:  A078652 A078653 A078654 * A078656 A078657 A078658

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Dec 14 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:55 EST 2012. Contains 205847 sequences.