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!)
A210073 1/4 the number of (n+1)X5 0..3 arrays with every 2X2 subblock having one or three distinct clockwise edge differences 1

%I #5 Mar 31 2012 12:37:31

%S 27129,4437262,707627792,114628150378,18568897568014,3010470408635630,

%T 488107505505461510,79144584564609543464,12833111893822360727629,

%U 2080870815907855835416746,337410806008722400116179002

%N 1/4 the number of (n+1)X5 0..3 arrays with every 2X2 subblock having one or three distinct clockwise edge differences

%C Column 4 of A210077

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 17 2012

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 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)