login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107320 a(1)=1 then a(n)=f(n)-a(f(n))+a(f(n)-a(f(n))) where f(n)=floor(n/2). 0
1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 6, 6, 7, 7, 9, 9, 9, 9, 10, 10, 11, 11, 12, 12, 11, 11, 12, 12, 12, 12, 14, 14, 12, 12, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 20, 20, 20, 20, 21, 21, 24, 24, 27, 27, 27, 27, 28, 28, 29, 29, 30, 30, 29, 29, 30, 30, 35, 35, 36, 36, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n)=(sqrt(2)-1)*n+o(n) (?)
PROG
(PARI) a(n)=if(n<2, 1, floor(n/2)-a(floor(n/2))+a(floor(n/2)-a(floor(n/2))))
CROSSREFS
Sequence in context: A156080 A334233 A271058 * A095186 A265340 A356993
KEYWORD
nonn
AUTHOR
Benoit Cloitre, May 21 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)