|
|
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)).
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 4 the a(4) = 2 solutions are [1,3,2,1] and [1,2,3,1].
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|