|
|
A301849
|
|
The Pagoda sequence: a sequence with isolated zeros in number-wall over finite fields.
|
|
3
|
|
|
-1, 0, 1, 0, -1, 1, 1, -1, -1, 0, 1, 1, -1, 0, 1, -1, -1, 0, 1, 0, -1, 1, 1, 0, -1, -1, 1, 1, -1, 0, 1, -1, -1, 0, 1, 0, -1, 1, 1, -1, -1, 0, 1, 1, -1, 0, 1, 0, -1, -1, 1, 0, -1, 1, 1, 0, -1, -1, 1, 1, -1, 0, 1, -1, -1, 0, 1, 0, -1, 1, 1, -1, -1, 0, 1, 1, -1, 0, 1, -1, -1, 0, 1, 0, -1, 1, 1, 0, -1, -1, 1, 1, -1, 0, 1, 0, -1, -1, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
c(0), c(1), ... is the fixed point of inflation morphism 1 -> 1 3, 2 -> 2 3, 3 -> 1 4, 4 -> 2 4, starting from state 1;
a(-1), a(0), ... is the image of c(n) under encoding morphism 1 -> -1,-1,0,+1, 2 -> 0,-1,-1,+1, 3 -> 0,-1,+1,+1, 4 -> +1,-1,0,+1;
The number-walls (signed Hankel determinants) over finite fields with characteristic -1 (mod 4) of this sequence have apparently only isolated zeros, though that has been proved only for p = 3,7.
|
|
REFERENCES
|
Jean-Paul Allouche and Jeffrey O. Shallit, Automatic sequences, Cambridge, 2003.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = b(n+1) - b(n-1), where b(n) denotes A038189(n).
|
|
MATHEMATICA
|
b[n_] := b[n] = If[n == 0, 0, BitGet[n, IntegerExponent[n, 2] + 1]];
a[n_] := b[n+1] - b[n-1];
|
|
PROG
|
(Magma)
function b (n)
if n eq 0 then return 0; // alternatively, return 1;
else while IsEven(n) do n := n div 2; end while; end if;
return n div 2 mod 2; end function;
function a (n)
return b(n+1) - b(n-1); end function;
nlo := 0; nhi := 32;
[a(n) : n in [nlo..nhi] ];
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|