A284434 - OEIS

A284434

The number of positive integer sequences of length n with no duplicate substrings, every number different from its neighbors, and a minimal product (i.e., the product of the sequence is A282169(n)).

%I #5 Mar 28 2017 15:03:12

%S 1,2,1,6,2,24,6

%N The number of positive integer sequences of length n with no duplicate substrings, every number different from its neighbors, and a minimal product (i.e., the product of the sequence is A282169(n)).

%e For n = 7 the a(7) = 6 solutions are:

%e [1,4,1,3,1,2,1],

%e [1,3,1,4,1,2,1],

%e [1,4,1,2,1,3,1],

%e [1,2,1,4,1,3,1],

%e [1,3,1,2,1,4,1], and

%e [1,2,1,3,1,4,1].

%Y Cf. A282169.

%K nonn,more

%O 1,2

%A _Peter Kagey_, Mar 27 2017