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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079951 Number of primes p with prime(n)==1 modulo 2*p. 2
0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 3, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 1, 2, 1, 3, 2, 2, 2, 2, 3, 2, 1, 3, 2, 2, 3, 1, 1, 1, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 3, 3, 1, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 2, 4, 2, 2, 2, 2, 2, 3, 3, 3, 1, 1, 1, 2, 2, 1, 2, 3, 2, 3, 3, 2, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..105.

EXAMPLE

n=6: prime(6)=13 and 13 mod(2*2)=1, 13 mod(2*3)=1, 13 mod(2*5)=3, 13 mod(2*7)=13, therefore a(6)=2.

CROSSREFS

Cf. A079950, A079952.

Sequence in context: A090455 A086288 A104360 * A095407 A038605 A113121

Adjacent sequences:  A079948 A079949 A079950 * A079952 A079953 A079954

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jan 19 2003

STATUS

approved

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 May 26 01:23 EDT 2013. Contains 225652 sequences.