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

%I #4 Dec 03 2014 16:48:49

%S 670690,464687066,321542579960,222571918258598,154063583681248806,

%T 106642617845371027692,73817882968740867259470,

%U 51096644852447901613635406,35369032672430117642615385524

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

%C Column 4 of A251507

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

%e Some solutions for n=1

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

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

%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 24 14:23 EDT 2024. Contains 371960 sequences. (Running on oeis4.)