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

%I #6 Sep 04 2022 22:20:13

%S 51474508,195351371872,761894242946484,2987170312757672908,

%T 11724359174003264630400,46027674099447532469280380,

%U 180705599017375127320670453920,709462514504983014544616127594356

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

%C Column 6 of A251499.

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

%e Some solutions for n=1

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

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

%Y Cf. A251499.

%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 16 01:01 EDT 2024. Contains 371696 sequences. (Running on oeis4.)