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!)
A267568 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any west or southwest neighbors modulo 4 and the upper left element equal to 0. 1

%I #6 Aug 12 2016 06:54:01

%S 6,2,3,15,170,1614,11048,60954,299110,1494098,8772195,61209175,

%T 450621524,3191383332,21167733740,133174852936,820343904175,

%U 5126587427874,33208210014133,222276340846479,1507709621631348,10169384286795946

%N Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any west or southwest neighbors modulo 4 and the upper left element equal to 0.

%C Row 4 of A267562.

%H R. H. Hardin, <a href="/A267568/b267568.txt">Table of n, a(n) for n = 1..31</a>

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267562.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 17 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 March 28 15:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)