|
|
A112865
|
|
a(n) = (-1)^(n + floor(n/4) + floor(n/4^2) + ...).
|
|
3
|
|
|
1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The n-th term t(n)=(-1)^S(n). S(n)=Sum[ b(k)*a(k), k=0,L-1] where n=Sum[a(k)*2^k, k=0,L-1] (binary expansion of n) and b(k)=1 only if mod(k,2)=0, b(k)=0 otherwise. Closely related to the Thue-Morse sequence where all b(k) are 1. Also appears as the column at the "one-third" position of the Walsh-Hadamard matrix.
|
|
LINKS
|
|
|
FORMULA
|
Euler transform of sequence b(n) where b(1) = 1, b(2^(2*k-1)) = -1, b(2^(2*k)) = 2 unless k=0, b(n) = 0 otherwise.
G.f.: (Product_{k>0} 1 - x^(4^k)) / (Product_{k>=0} 1 + x^(4^k)). - Michael Somos, Aug 15 2008
|
|
MAPLE
|
f:= proc(n) option remember; (-1)^n*procname(floor(n/4)) end proc:
f(0):= 1:
|
|
PROG
|
(PARI) {a(n) = if( n<1, n==0, (-1)^n * a(n \ 4))} /* Michael Somos, Aug 15 2008 */
(PARI) {a(n) = local(A); if( n<0, 0, A = Vecrev(binary(n)); (-1)^sum(k=1, #A, A[k] * (k%2)))} /* Michael Somos, Aug 15 2008 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Arul Lakshminarayan (arul(AT)physics.iitm.ac.in), Sep 27 2005
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|