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!)
A236796 Number of (n+1) X (6+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock equal. 1

%I #6 Apr 25 2023 13:59:48

%S 34317,1116735,34857701,1381705469,51617074157,2080964832157,

%T 80831358255875,3246690468651521,127675344307348211,

%U 5106528090828728761,201854340535907506975,8051075437258209188323,319049152204403311985513

%N Number of (n+1) X (6+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2 X 2 subblock equal.

%C Column 6 of A236798.

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

%e Some solutions for n=1

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

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

%Y Cf. A236798.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 31 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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)