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!)
A183598 1/6 the number of (n+1)X5 0..2 arrays with every 2X2 subblock containing all three values 1

%I #5 Mar 31 2012 12:35:53

%S 534,10797,201770,3831324,72592860,1376627608,26108240340,

%T 495215814566,9393691937690,178194216929170,3380332407037684,

%U 64125402470512942,1216476053110547726,23076960013228726054,437778595866783333858

%N 1/6 the number of (n+1)X5 0..2 arrays with every 2X2 subblock containing all three values

%C Column 4 of A183603

%H R. H. Hardin, <a href="/A183598/b183598.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n)=29*a(n-1)-116*a(n-2)-2075*a(n-3)+10702*a(n-4)+51511*a(n-5)-261497*a(n-6)-510094*a(n-7)+2707193*a(n-8)+1565260*a(n-9)-12569843*a(n-10)+2644843*a(n-11)+22771798*a(n-12)-13641330*a(n-13)-14269732*a(n-14)+12528656*a(n-15)+1720808*a(n-16)-3240288*a(n-17)+392640*a(n-18)+109056*a(n-19)

%e Some solutions with a(1,1)=0 for 3X5

%e ..0..2..0..2..1....0..2..1..1..2....0..2..1..1..0....0..0..0..1..2

%e ..0..1..1..0..0....1..1..0..2..0....1..0..2..0..2....2..1..2..1..0

%e ..2..2..0..2..1....0..2..1..1..1....1..2..1..2..1....1..0..0..0..2

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 2011

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 April 24 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)