The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A266879 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north, southwest or northwest neighbor modulo 3 and the upper left element equal to 0. 2

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

%S 1,1,2,5,11,26,46,121,400,1109,2924,7992,21954,61748,176647,499953,

%T 1409763,3999662,11391787,32574599,93459472,268336008,771070141,

%U 2219952038,6403510479,18502345738,53538515560,155090741042,449731074132

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

%C Row 3 of A266878.

%H R. H. Hardin, <a href="/A266879/b266879.txt">Table of n, a(n) for n = 1..104</a>

%e All solutions for n=4

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

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

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

%Y Cf. A266878.

%K nonn

%O 1,3

%A _R. H. Hardin_, Jan 05 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 May 28 04:02 EDT 2024. Contains 372900 sequences. (Running on oeis4.)