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!)
A210293 Half the number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having at most one duplicate clockwise edge difference. 1
112, 1578, 22212, 312704, 4402192, 61973516, 872455004, 12282307884, 172908727756, 2434186513236, 34268160178956, 482422688537636, 6791483674595260, 95609621185469444, 1345979774260696316 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 1 of A210300.
LINKS
FORMULA
Empirical: a(n) = 11*a(n-1) + 42*a(n-2) + 20*a(n-3) - 18*a(n-4).
Empirical g.f.: 2*x*(56 + 173*x + 75*x^2 - 72*x^3) / (1 - 11*x - 42*x^2 - 20*x^3 + 18*x^4). - Colin Barker, Jul 15 2018
EXAMPLE
Some solutions for n=4:
..2..0....3..1....3..2....1..3....1..1....1..0....2..3....1..0....1..3....2..1
..3..0....1..0....3..0....1..3....2..2....2..0....0..1....0..0....2..2....1..1
..2..0....2..2....1..1....3..2....1..0....1..2....2..0....0..3....0..2....3..3
..3..1....1..1....1..2....1..3....0..3....1..3....0..1....1..3....2..1....0..1
..1..2....0..3....2..2....0..1....0..0....0..0....3..0....1..0....1..1....0..0
CROSSREFS
Cf. A210300.
Sequence in context: A367363 A327633 A210300 * A203915 A233884 A246895
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 19 2012
STATUS
approved

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 March 29 07:27 EDT 2024. Contains 371265 sequences. (Running on oeis4.)