OFFSET
1,4
COMMENTS
The n-th Hankel matrix of the sequence is formed by making an n X n matrix with each row a successive length-n "window" into the sequence.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..1000
Robbert Fokkink, Cor Kraaikamp, and Jeffrey Shallit, Hankel matrices for the period-doubling sequence, arxiv preprint arXiv:1511.06569 [math.CO], 2015-2016.
MATHEMATICA
periodDouble[n_] :=Module[{A = {0, 1}}, For[i = 2, i <= n, i++, AppendTo[A, If[EvenQ[i], 1 - A[[ Floor[i/2] ]], 1]]]; A];
a[n_] := Module[{A, M}, A = periodDouble[2n-1]; M = Table[If[i == 0, 1, A[[i]]] , {j, 0, n-1}, {i, j, n+j-1}]; Det[M]];
Array[a, 70] (* Jean-François Alcover, Aug 12 2018, after Tom Edgar *)
PROG
(Sage)
def periodDouble(n):
A=[0, 1]
for i in [2..n]:
if i%2==0:
A.append(1-A[floor(i/2)])
else:
A.append(1)
return A[1:]
def a(n):
A=periodDouble(2*n-1)
M=matrix([[A[i] for i in [j..n+j-1]] for j in [0..n-1]])
return det(M)
[a(i) for i in [1..70]] # Tom Edgar, Nov 30 2015
CROSSREFS
KEYWORD
sign,look
AUTHOR
Jeffrey Shallit, Nov 30 2015
STATUS
approved