login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the 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)).
0
1, 2, 1, 6, 2, 24, 6
OFFSET
1,2
EXAMPLE
For n = 7 the a(7) = 6 solutions are:
[1,4,1,3,1,2,1],
[1,3,1,4,1,2,1],
[1,4,1,2,1,3,1],
[1,2,1,4,1,3,1],
[1,3,1,2,1,4,1], and
[1,2,1,3,1,4,1].
CROSSREFS
Cf. A282169.
Sequence in context: A217955 A325703 A321898 * A306543 A243484 A181811
KEYWORD
nonn,more
AUTHOR
Peter Kagey, Mar 27 2017
STATUS
approved