Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076213
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076213 2*a(n)-1 = sign(A005132(n+1)-A005132(n)). +0
2
1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1 (list; graph; listen)
OFFSET

1,1

FORMULA

Conjecture: let s(n)=sum(k=1, n, a(k)), then lim n ->infinity s(n)/n = 1/2; for any n, 2*s(n)>n; let v(n)=2*s(n)-n, then v(n)/ln(n) is bounded and sum(k=1, n, v(k)) is asymptotic to c*n*ln(n) with 1<c<1.5

CROSSREFS

Sequence in context: A030302 A051023 A030657 this_sequence A010890 A011633 A015254

Adjacent sequences: A076210 A076211 A076212 this_sequence A076214 A076215 A076216

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 03 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research