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

%I

%S 492373,155490654,47417927307,14741920546390,4558499131132306,

%T 1413503057063618368,437706800031436404447,135637740882655309176164,

%U 42015985984488346140563741,13017745880887035269283799043

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

%C Column 6 of A209858

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

%e Some solutions for n=4

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

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

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

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

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

%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 May 18 12:47 EDT 2022. Contains 353807 sequences. (Running on oeis4.)