Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082851 Partial sums of A082850. +0
3
1, 2, 4, 5, 6, 8, 11, 12, 13, 15, 16, 17, 19, 22, 26, 27, 28, 30, 31, 32, 34, 37, 38, 39, 41, 42, 43, 45, 48, 52, 57, 58, 59, 61, 62, 63, 65, 68, 69, 70, 72, 73, 74, 76, 79, 83, 84, 85, 87, 88, 89, 91, 94, 95, 96, 98, 99, 100, 102, 105, 109, 114, 120, 121, 122, 124, 125, 126 (list; graph; listen)
OFFSET

1,2

COMMENT

It seems that n/(2n-a(n)) is an integer for infinitely many values of n, see A082396.

FORMULA

Limit n->infinity a(n)/n = 2. Is (2-a(n)/n)*sqrt(n)*log(n) bounded?

MAPLE

A082850 := proc(n) option remember ; local m ; if n <= 3 then op(n, [1, 1, 2]) ; else m := ilog2(n+1) ; if n = 2^m -1 then m; else m := ilog2(n) ; return procname(n+1-2^m) ; end if ; end if; end proc:

A082851 := proc(n) add( A082850(i), i=1..n) ; end proc: seq(A082851(n), n=1..100) ; # R. J. Mathar, Nov 17 2009

CROSSREFS

Sequence in context: A093080 A059916 A099747 this_sequence A091207 A099247 A007192

Adjacent sequences: A082848 A082849 A082850 this_sequence A082852 A082853 A082854

KEYWORD

nonn,easy

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2003

EXTENSIONS

Minor edits by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 17 2009

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research