OFFSET
2,2
COMMENTS
Conjecture: The rank of the matrix M is 2 for every n.
LINKS
Simone Severini, www-users.york.ac.uk/~ss54.
EXAMPLE
For n=2, M=[0,1;1,0];
For n=3, M=[0,1,1;2,3,5;8,13,21].
PROG
(PARI) permRWNb(a)=n=matsize(a)[1]; if(n==1, return(a[1, 1])); sg=1; in=vectorv(n); x=in; x=a[, n]-sum(j=1, n, a[, j])/2; p=prod(i=1, n, x[i]); for(k=1, 2^(n-1)-1, sg=-sg; j=valuation(k, 2)+1; z=1-2*in[j]; in[j]+=z; x+=z*a[, j]; p+=prod(i=1, n, x[i], sg)); return(2*(2*(n%2)-1)*p) for(n=1, 23, a=matrix(n, n, i, j, fibonacci((i-1)*n+j-1)); print1(permRWNb(a)", ")) - Herman Jamke (hermanjamke(AT)fastmail.fm), May 15 2007
CROSSREFS
KEYWORD
nonn
AUTHOR
Simone Severini, Feb 15 2006
EXTENSIONS
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 15 2007
STATUS
approved