|
%I #9 Mar 28 2017 15:02:50
%S 1,2,1,6,2,42,12,116
%N The number of positive integer sequences of length n with no duplicate substrings of length greater than 1, every number different from its neighbors, and a minimal sum (i.e., the sum of the sequence is A282166(n)).
%e For n = 5, the a(5) = 2 sequences are [1,3,1,2,1] and [1,2,1,3,1], each with a sum of A282166(5) = 8.
%Y Cf. A282166.
%K nonn,more
%O 1,2
%A _Peter Kagey_, Mar 27 2017
|
