|
Search: id:A080079
|
|
|
| A080079 |
|
Least number causing the longest carry sequence when adding numbers <= n to n in binary representation. |
|
+0
7
|
|
| 1, 2, 1, 4, 3, 2, 1, 8, 7, 6, 5, 4, 3, 2, 1, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
T(n,k)<T(n,a(n))=A070940(n) for 1<=k<a(n) and T(n,k)<=T(n,a(n)) for a(n)<=k<=n, where T is defined as in A080080.
a(n) = n iff n=2^k, a(n) = A035327(n-1) otherwise. Equals A062383(n)-n. - Ralf Stephan, Jun 02 2003
|
|
FORMULA
|
a(n)=A004755(n)-2n; a(n)=-n+2*2^floor(log(n)/log(2)). - Benoit Cloitre, Feb 22 2003
a(0) = 0, a(2n) = 2a(n), a(2n+1) = 2a(n)-1+2[n==0]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jan 04 2004
|
|
CROSSREFS
|
Sequence in context: A051129 A067410 A109977 this_sequence A082467 A106407 A023141
Adjacent sequences: A080076 A080077 A080078 this_sequence A080080 A080081 A080082
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 26 2003
|
|
|
Search completed in 0.002 seconds
|
