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

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

%S 49484,13288986,3506487749,934012605398,248817068842201,

%T 66307681156504928,17671175952055398322,4709507638686926395711,

%U 1255126061290822709489429,334502823235487329400306910

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

%C Column 4 of A210355

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 20 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 August 30 07:09 EDT 2024. Contains 375532 sequences. (Running on oeis4.)