Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078653
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078653 a(n) = prime(k) where k = n-th prime congruent to 1 mod 4. +0
2
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; listen)
OFFSET

0,1

COMMENT

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

PROGRAM

(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: A065049 A158201 A122015 this_sequence A040167 A040170 A085564

Adjacent sequences: A078650 A078651 A078652 this_sequence A078654 A078655 A078656

KEYWORD

easy,nonn

AUTHOR

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

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research