A284436 - OEIS

A284436

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

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

%S 1,2,6,2,18,12,24,24,1320

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

%e For n = 4 the a(4) = 2 solutions are [1,3,2,1] and [1,2,3,1].

%Y Cf. A282167.

%K nonn,more

%O 1,2

%A _Peter Kagey_, Mar 27 2017