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

%I

%S 295759,128887759,56040713651,24381056748093,10607219852841053,

%T 4614802877342194801,2007727783867224687619,873487174422941192592727,

%U 380021561340335015020932351,165333151346118950517287569313

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

%C Column 5 of A251390.

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

%e Some solutions for n=1

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

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

%Y Cf. A251390.

%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 February 3 23:01 EST 2023. Contains 360045 sequences. (Running on oeis4.)