A284431 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

1, 2, 1, 6, 2, 42, 12, 116

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

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

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

Cf. A282166.

Sequence in context: A306543 A243484 A181811 * A333078 A352376 A337470

Adjacent sequences: A284428 A284429 A284430 * A284432 A284433 A284434

KEYWORD

nonn,more

AUTHOR

Peter Kagey, Mar 27 2017

STATUS

approved