login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204102 Number of (n+1) X 5 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that b(i,j)*b(i-1,j)-c(i,j)*c(i,j-1) is nonzero. 2
2304, 31104, 419904, 5738688, 78428736, 1073134656, 14683622976, 200937920832, 2749733365824, 37629117912384, 514941023905344, 7046791236157248, 96432920316542016, 1319651562497299776, 18058980695442371136 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Also 0..2 arrays with no 2 X 2 subblock having equal diagonal elements or equal antidiagonal elements.
LINKS
FORMULA
Empirical: a(n) = 15*a(n-1) - 270*a(n-3) + 324*a(n-4).
Empirical g.f.: 576*x*(4 - 6*x - 81*x^2 + 108*x^3) / ((1 - 15*x + 18*x^2)*(1 - 18*x^2)). - Colin Barker, Mar 03 2018
EXAMPLE
Some solutions for n=5:
0 2 0 1 2 2 2 1 2 0 2 2 0 0 2 2 0 0 0 2
0 1 0 1 0 1 0 1 2 0 1 1 1 1 2 2 1 1 1 1
2 1 2 2 0 1 2 1 2 0 2 2 0 0 0 2 0 2 2 2
2 0 0 1 1 1 2 1 2 1 1 1 1 1 2 2 0 1 0 1
1 1 2 2 0 1 0 0 2 1 2 2 2 0 2 1 0 1 2 1
0 0 0 1 0 2 2 1 2 1 0 0 1 0 1 1 2 1 2 0
CROSSREFS
Sequence in context: A179699 A195652 A256729 * A177759 A218431 A187292
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 10 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 02:14 EDT 2024. Contains 375396 sequences. (Running on oeis4.)