|
| |
|
|
A136013
|
|
a(n) = floor(n/2) + 2 a(floor(n/2), a(0) = 0.
|
|
0
| |
|
|
0, 0, 1, 1, 4, 4, 5, 5, 12, 12, 13, 13, 16, 16, 17, 17, 32, 32, 33, 33, 36, 36, 37, 37, 44, 44, 45, 45, 48, 48, 49, 49, 80, 80, 81, 81, 84, 84, 85, 85, 92, 92, 93, 93, 96, 96, 97, 97, 112, 112, 113, 113, 116, 116, 117, 117, 124, 124, 125, 125, 128
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| A recursive sequence that seems to be related to the ruler function.
It seems that a(2n)=a(2n+1)=A080277(n). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 31 2008
|
|
|
MAPLE
| a:=proc(n) if n=0 then 0 else floor((1/2)*n)+2*a(floor((1/2)*n)) end if end proc: seq(a(n), n=0..60); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 31 2008
|
|
|
MATHEMATICA
| a = {0}; Do[AppendTo[a, Floor[n/2] + 2*a[[Floor[n/2] + 1]]], {n, 1, 100}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 24 2008
|
|
|
CROSSREFS
| Cf. A080277.
Sequence in context: A120205 A152465 A082968 * A114884 A132704 A202151
Adjacent sequences: A136010 A136011 A136012 * A136014 A136015 A136016
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Jack Preston (jpreston(AT)earthlink.net), Mar 20 2008
|
|
|
EXTENSIONS
| More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 24 2008
Spelling corrected by Jason G. Wurtzel (j_seq(AT)wurtzel.com), Aug 30 2010
|
| |
|
|
