|
|
A284432
|
|
The number of positive integer sequences of length n with no duplicate substrings (forward or backward) and a minimal sum (i.e., the sum of the sequence is A282168(n)).
|
|
0
|
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 7 the a(7) = 4 solutions are:
[1,3,3,2,2,1,1],
[1,2,2,3,3,1,1],
[1,1,3,3,2,2,1], and
[1,1,2,2,3,3,1].
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|