Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079952
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079952 Number of primes p such that prime(n) mod 2*p < prime(n). +0
4
0, 0, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 12, 13, 14, 15, 15, 15, 16, 16, 16, 18, 18, 19, 19, 21, 21, 21, 22, 23, 23, 24, 24, 24, 24, 25, 25, 27, 29, 30, 30, 30, 30, 30, 30, 31, 32, 32, 32, 33, 34, 34, 34, 36, 36, 36, 37, 38, 39, 40, 40, 40, 41, 42, 42, 42 (list; graph; listen)
OFFSET

1,4

COMMENT

T(n,a(n)+1)=A000040(n), T defined as in A079950.

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)=3.

CROSSREFS

Cf. A079953, A079951.

Cf. A055930. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 15 2008]

Sequence in context: A057355 A160511 A055930 this_sequence A090638 A057363 A073869

Adjacent sequences: A079949 A079950 A079951 this_sequence A079953 A079954 A079955

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 19 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 November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research