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!)
A266035 Number of 3Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than itself. 1

%I

%S 1,55,481,5594,121029,2045306,33026298,562735444,9532097947,

%T 160132082576,2699812308573,45545430005680,767636583946670,

%U 12939677383177473,218153972376875945,3677676423588950515,61997693315879549117

%N Number of 3Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than itself.

%C Row 3 of A266033.

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

%e Some solutions for n=4

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

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

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

%Y Cf. A266033.

%K nonn

%O 1,2

%A _R. H. Hardin_, Dec 20 2015

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 June 25 12:30 EDT 2022. Contains 354851 sequences. (Running on oeis4.)