cp's OEIS Frontend

A209724 1/4 the number of (n+1) X 6 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.

%I A209724 #26 Nov 09 2020 00:36:18
%S A209724 8,9,10,12,14,18,22,30,38,54,70,102,134,198,262,390,518,774,1030,1542,
%T A209724 2054,3078,4102,6150,8198,12294,16390,24582,32774,49158,65542,98310,
%U A209724 131078,196614,262150,393222,524294,786438,1048582,1572870,2097158
%N A209724 1/4 the number of (n+1) X 6 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.
%C A209724 Column 5 of A209727.
%C A209724 Conjecture: a(1) = 8; for n > 1, a(n) is the smallest integer m such that m = ((2x * a(n-1)) /(x+1)) - x , with x  a positive nontrivial divisor of m.  (This is true at least for a(1) to a(100).) - _Enric Reverter i Bigas_, Oct 11 2020
%H A209724 R. H. Hardin, <a href="/A209724/b209724.txt">Table of n, a(n) for n = 1..210</a>
%F A209724 Empirical: a(n) = a(n-1) +2*a(n-2) -2*a(n-3).
%F A209724 Conjectures from _Colin Barker_, Mar 07 2018: (Start)
%F A209724 G.f.: x*(8 + x - 15*x^2) / ((1 - x)*(1 - 2*x^2)).
%F A209724 a(n) = 3*2^(n/2-1) + 6 for n even.
%F A209724 a(n) = 2^((n+1)/2) + 6 for n odd.
%F A209724 (End)
%e A209724 Some solutions for n=4:
%e A209724 ..2..1..2..1..2..1....2..0..2..0..1..0....2..1..2..1..2..1....0..1..0..1..0..2
%e A209724 ..0..2..0..2..0..2....1..2..1..2..0..2....0..2..0..2..0..2....2..0..2..0..2..1
%e A209724 ..1..0..1..0..1..0....2..0..2..0..1..0....2..1..2..1..2..1....0..1..0..1..0..2
%e A209724 ..0..2..0..2..0..2....1..2..1..2..0..2....0..2..0..2..0..2....2..0..2..0..2..1
%e A209724 ..1..0..1..0..1..0....2..0..2..0..1..0....1..0..1..0..1..0....0..1..0..1..0..2
%Y A209724 Cf. A153972, A209727.
%K A209724 nonn
%O A209724 1,1
%A A209724 _R. H. Hardin_, Mar 12 2012