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!)
A209909 Half the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences 1

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

%S 44770,6711168,948609890,135833193008,19391662870652,2771380588485262,

%T 395928291655518846,56572313966664992566,8082834582799800606818,

%U 1154877996377518700415076,165007101830680869540237766

%N Half the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences

%C Column 4 of A209913

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 15 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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)