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

%I #4 Dec 03 2014 18:36:01

%S 3798,227174,13580282,811863390,48535019898,2901533826974,

%T 173460282721706,10369849728580798,619933172482703578,

%U 37061013265529804958,2215591559271926856906,132453096259066371311422

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

%C Column 2 of A251524

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

%F Empirical: a(n) = 59*a(n-1) +67*a(n-2) -1223*a(n-3) +782*a(n-4) +1020*a(n-5) -520*a(n-6)

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 03 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 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)