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!)
A266656 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its northeast neighbor modulo 3 and the upper left element equal to 0. 2

%I #6 Aug 12 2016 06:53:59

%S 2,11,91,829,8013,80497,830673,8743293,93437237,1010633645,

%T 11038556349,121547316675,1347523434675,15026262949575,

%U 168400839231879,1895558909938005,21419116890326757,242855221965797157

%N Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its northeast neighbor modulo 3 and the upper left element equal to 0.

%C Row 3 of A266655.

%H R. H. Hardin, <a href="/A266656/b266656.txt">Table of n, a(n) for n = 1..87</a>

%e Some solutions for n=4

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

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

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

%Y Cf. A266655.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 02 2016

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 September 3 09:02 EDT 2024. Contains 375656 sequences. (Running on oeis4.)