|
Search: id:A088705
|
|
|
| A088705 |
|
First differences of A000120. One minus exponent of 2 in n. |
|
+0
4
|
|
| 0, 1, 0, 1, -1, 1, 0, 1, -2, 1, 0, 1, -1, 1, 0, 1, -3, 1, 0, 1, -1, 1, 0, 1, -2, 1, 0, 1, -1, 1, 0, 1, -4, 1, 0, 1, -1, 1, 0, 1, -2, 1, 0, 1, -1, 1, 0, 1, -3, 1, 0, 1, -1, 1, 0, 1, -2, 1, 0, 1, -1, 1, 0, 1, -5, 1, 0, 1, -1, 1, 0, 1, -2, 1, 0, 1, -1, 1, 0, 1, -3, 1, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
COMMENT
|
a(n) = A000120(n+1) - A000120(n) = 1 - A007814(n).
Multiplicative with a(2^e) = 1-e, a(p^e) = 1 otherwise. David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
G.f.: sum(k>=0, t/(1+t), t=x^2^k).
a(0)=0, a(2n) = a(n) - 1, a(2n+1) = 1.
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, if(n%2==0, a(n/2)-1, 1))
(PARI) a(n)=if(n<1, 0, 1-valuation(n, 2))
|
|
CROSSREFS
|
Sequence in context: A016353 A016398 A024359 this_sequence A065712 A153172 A016194
Adjacent sequences: A088702 A088703 A088704 this_sequence A088706 A088707 A088708
|
|
KEYWORD
|
sign,easy,mult
|
|
AUTHOR
|
Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 10 2003
|
|
|
Search completed in 0.002 seconds
|
