login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085765 Partial sums and bisection of A086450. 1
1, 2, 4, 5, 9, 11, 16, 17, 26, 30, 41, 43, 59, 64, 81, 82, 108, 117, 147, 151, 192, 203, 246, 248, 307, 323, 387, 392, 473, 490, 572, 573, 681, 707, 824, 833, 980, 1010, 1161, 1165, 1357, 1398, 1601, 1612, 1858, 1901, 2149, 2151, 2458, 2517 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Sum of inverses of a(n) is 1.5398789314089581123...

Conjecture: log(a(n))/log(n) grows unboundedly.

Conjecture: a(n) mod 2 repeats the 7-pattern 0,0,1,1,1,0,1.

The conjecture concering the mod 2 pattern follows directly from the corresponding conjecture proved in A086450. - Lambert Herrgesell (zero815(AT)googlemail.com), May 08 2007

PROG

v=vector(1000):v[1]=1:s=1:for(n=2, 1000, v[n]=if(n%2==0, v[n/2], s=s+v[(n+1)/2]:print1(s", "):s))

CROSSREFS

Sequence in context: A192615 A065514 A152186 * A039871 A161375 A039021

Adjacent sequences:  A085762 A085763 A085764 * A085766 A085767 A085768

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Jul 22 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 03:03 EST 2012. Contains 205567 sequences.