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

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

%S 68201,10137464,1460712837,213959648565,31192434742293,

%T 4558499131132306,665390868679472699,97186568439693174719,

%U 14190270163904001178515,2072301261390366075837054,302603111366297145304112118

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

%C Column 5 of A209858

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 14 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 24 11:21 EDT 2024. Contains 371936 sequences. (Running on oeis4.)