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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284433 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 sum (i.e., the sum of the sequence is A282167(n)). 0
1, 2, 6, 2, 18, 12, 24, 24, 1320 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

For n = 4 the a(4) = 2 solutions are [1,3,2,1] and [1,2,3,1].

CROSSREFS

Cf. A282167.

Sequence in context: A126287 A236697 A235797 * A284436 A322312 A174857

Adjacent sequences:  A284430 A284431 A284432 * A284434 A284435 A284436

KEYWORD

nonn,more

AUTHOR

Peter Kagey, Mar 27 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 18:13 EDT 2022. Contains 356122 sequences. (Running on oeis4.)