Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078656
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078656 a(n) = prime(k) where k = n-th prime congruent to 1 mod 10. +0
1
31, 127, 179, 283, 353, 547, 739, 877, 1087, 1153, 1297, 1523, 1597, 1741, 1823, 2063, 2221, 2749, 2909, 3001, 3259, 3517, 3733, 3911, 4153, 4421, 4663, 4759, 4943, 5189, 5281, 5701, 5801, 6229, 6311, 6841, 7109, 7417, 7649, 7841, 8117, 8221, 8389, 8513 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Prime[10Select[Range[110], PrimeQ[10# + 1] &] + 1]

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. A024912.

Adjacent sequences: A078653 A078654 A078655 this_sequence A078657 A078658 A078659

Sequence in context: A042884 A042886 A042888 this_sequence A095322 A127578 A079141

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

Edited by Robert G. Wilson v (kspaint.com), Dec 17 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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research