|
|
A284431
|
|
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)).
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
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.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|