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)).

1, 2, 1, 6, 2, 24, 6

Offset

1,2

Links

Table of n, a(n) for n=1..7.

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

Adjacent sequences: A284431 A284432 A284433 * A284435 A284436 A284437

Keyword

nonn,more

Author

Peter Kagey, Mar 27 2017

Status

approved