Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084196
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084196 Number of primes q<prime(n) such that q+1 divides prime(n)+1. +0
6
0, 0, 1, 1, 3, 0, 2, 1, 5, 2, 2, 0, 3, 1, 6, 3, 6, 0, 1, 7, 0, 3, 6, 4, 1, 2, 2, 6, 0, 3, 3, 5, 2, 3, 3, 3, 0, 1, 9, 2, 9, 1, 8, 0, 3, 3, 1, 4, 6, 0, 3, 11, 0, 8, 2, 8, 6, 3, 0, 2, 1, 5, 3, 7, 0, 2, 1, 0, 5, 1, 2, 13, 2, 0, 3, 10, 3, 0, 2, 0, 11, 0, 11, 2, 5, 5, 6, 0, 4, 2, 6, 13, 2, 5, 2, 13, 4, 4, 1, 0, 1, 4 (list; graph; listen)
OFFSET

1,5

COMMENT

a(A049084(A082539(n)))=0, a(A049084(A084197(n)))>0, a(A049084(A084198(n)))=1;

EXAMPLE

n=5, prime(5)=11: (11+1) mod (q+1) = 0 for 3 primes q<11: 2, 3,

and 5, therefore a(5)=3.

CROSSREFS

Cf. A084198, A084200.

Adjacent sequences: A084193 A084194 A084195 this_sequence A084197 A084198 A084199

Sequence in context: A021335 A089595 A034389 this_sequence A127913 A135991 A102003

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 18 2003

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 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research