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!)
A251385 Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6 1

%I #4 Dec 01 2014 22:03:29

%S 4585,271393,16036923,948010753,56040713651,3312804237391,

%T 195833921630923,11576574968972023,684340522656108629,

%U 40454275333788296091,2391424062526227373613,141367234975433997443721

%N Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6

%C Column 3 of A251390

%H R. H. Hardin, <a href="/A251385/b251385.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 63*a(n-1) -155*a(n-2) -4658*a(n-3) +12612*a(n-4) +104334*a(n-5) -242452*a(n-6) -787537*a(n-7) +1342994*a(n-8) +1584245*a(n-9) -2822088*a(n-10) -447621*a(n-11) +1812174*a(n-12) -339424*a(n-13) -296064*a(n-14) +90240*a(n-15)

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 01 2014

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 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)