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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078653 a(n) = prime(k) where k = n-th prime congruent to 1 mod 4. 1
11, 41, 59, 109, 157, 179, 241, 283, 367, 461, 509, 547, 599, 617, 773, 859, 919, 1031, 1087, 1171, 1201, 1447, 1471, 1523, 1621, 1723, 1787, 1823, 1913, 2081, 2099, 2269, 2351, 2381, 2549, 2683, 2719 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Sum 1/a(n) appears to converge albeit slowly.

MATHEMATICA

With[{pc14=Select[Prime[Range[100]], Mod[#, 4]==1&]}, Flatten[Table[ Prime[ Take[ pc14, {n}]], {n, 40}]]] (* From Harvey P. Dale, Aug 12 2011 *)

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

Cf. A006450, A078654.

Sequence in context: A158201 A122015 A192820 * A040167 A040170 A085564

Adjacent sequences:  A078650 A078651 A078652 * A078654 A078655 A078656

KEYWORD

easy,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 02:35 EST 2012. Contains 205689 sequences.