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!)
A234224 Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). 1

%I #6 Jun 19 2022 02:03:45

%S 32384,76972,188040,503272,1379816,4055128,12178344,38671960,

%T 125308904,425135512,1469047080,5270085592,19196627816,72039007768,

%U 273444136104,1062448914520,4159847890664,16591856007832,66478192455720

%N Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).

%H R. H. Hardin, <a href="/A234224/b234224.txt">Table of n, a(n) for n = 1..108</a>

%F Empirical: a(n) = 10*a(n-1) +16*a(n-2) -460*a(n-3) +789*a(n-4) +7170*a(n-5) -23944*a(n-6) -39920*a(n-7) +246076*a(n-8) -38440*a(n-9) -1115136*a(n-10) +1151040*a(n-11) +2005056*a(n-12) -3657600*a(n-13) -331776*a(n-14) +3456000*a(n-15) -1658880*a(n-16).

%e Some solutions for n=3:

%e 0 3 0 0 4 1 2 2 2 1 2 1 0 2 1 1 0 0 0 1 1 0 3 4

%e 0 0 0 3 4 4 1 4 1 3 1 3 3 2 4 1 3 0 3 1 4 0 0 4

%e 0 3 0 0 4 1 1 1 1 0 1 0 2 4 3 3 2 2 3 4 4 3 0 1

%e 0 0 0 3 4 4 0 3 0 2 0 2 3 2 4 1 3 0 0 4 1 3 3 1

%Y Column 5 of A234227.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 21 2013

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 September 16 11:18 EDT 2024. Contains 375965 sequences. (Running on oeis4.)