|
%I #5 Mar 28 2017 15:03:18
%S 1,1,2,2,4,4,4,48,144,144
%N The number of positive integer sequences of length n with no duplicate substrings (forward or backward) and a minimal product (i.e., the product of the sequence is A282193(n)).
%e For n = 7 the a(7) = 4 solutions are:
%e [1,3,3,2,2,1,1],
%e [1,2,2,3,3,1,1],
%e [1,1,3,3,2,2,1], and
%e [1,1,2,2,3,3,1].
%Y Cf. A282193.
%K nonn,more
%O 1,3
%A _Peter Kagey_, Mar 27 2017
|
