Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104120
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104120 (Prime(n + 1) - Prime(n))/2 (mod 2). +0
1
1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1 (list; graph; listen)
OFFSET

2,1

COMMENT

Questions: Is s(n) = (1/n) Sum[a(i),{i,2,n+1)] > 1/2 for all n? Does s(n) --> 1/2 ?

EXAMPLE

(Prime(2 + 1) - Prime(2)) (mod 2) = (5 - 3)/2 (mod 2) = 1 mod 2 = 1. So a(1) = 1.

MATHEMATICA

Table[Mod[(Prime[i + 1] - Prime[i])/2, 2], {i, 2, 100}]

CROSSREFS

Cf. A028334.

Sequence in context: A105470 A087429 A093075 this_sequence A108336 A118268 A136669

Adjacent sequences: A104117 A104118 A104119 this_sequence A104121 A104122 A104123

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Mar 06 2005

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research