OFFSET
1,2
COMMENTS
Let M(infinity) be the infinite matrix with coefficient m(i,j) i>=1, j>=1 defined as follows : M(0)=1 and M(k) is the 2^k X 2^k matrix following the recursion : +M(k-1)-M(k-1) M(k)= -M(k-1)-M(k-1).
LINKS
Sela Fried, On sequence A094384, 2026.
FORMULA
It appears that abs(a(n)) = 2^A000788(n).
What is the rule for signs? Does Sum_{k=1..n} a(k+1)/a(k) = 0 iff n is in A073536?.
Conjecture: a(n) = (-2)^A000788(n-1). - Chai Wah Wu, Nov 12 2024
The comment above regarding the signs is false but the conjecture is true (see Fried link). - Sela Fried, Feb 05 2026
EXAMPLE
M(2) = [1,-1;-1,-1] then a(2) = detM(2) = -2.
PROG
(Python)
from sympy import Matrix
def A094384(n):
m = Matrix([1])
for i in range((n-1).bit_length()):
m = Matrix([[m, -m], [-m, -m]])
return m[:n, :n].det() # Chai Wah Wu, Nov 12 2024
CROSSREFS
KEYWORD
sign
AUTHOR
Benoit Cloitre, Jun 03 2004
STATUS
approved
