|
| |
|
|
A010078
|
|
Shortest representation of -n in 2's-complement format.
|
|
0
| |
|
|
1, 2, 5, 4, 11, 10, 9, 8, 23, 22, 21, 20, 19, 18, 17, 16, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67, 66, 65, 64, 191, 190, 189
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
|
FORMULA
| a(n)=2^(ceil(log2(n)+1)) - n.
a(n) = b(n-1), where b(n) = if n=0 then 1 else 2*b(floor(n/2)) + 1 - n mod 2. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 19 2003
G.f. x/(1-x) * (1/x + sum(k>=0, 2^k(x^2^k+2x^2^(k+1))/(1+x^2^k))). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jun 15 2003
a(1) = 1; for n>1, a(2n-1) = 2*a(n) + 1; for n>=1, a(2n) = 2*a(n) . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 29 2004
|
|
|
CROSSREFS
| Sequence in context: A100710 A069913 A072403 * A074639 A002314 A177979
Adjacent sequences: A010075 A010076 A010077 * A010079 A010080 A010081
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| leo(AT)mailcom.com (Leonid Broukhis)
|
| |
|
|
