login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284434 The number of positive integer sequences of length n with no duplicate substrings, every number different from its neighbors, and a minimal product (i.e., the product of the sequence is A282169(n)). 0
1, 2, 1, 6, 2, 24, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

For n = 7 the a(7) = 6 solutions are:

[1,4,1,3,1,2,1],

[1,3,1,4,1,2,1],

[1,4,1,2,1,3,1],

[1,2,1,4,1,3,1],

[1,3,1,2,1,4,1], and

[1,2,1,3,1,4,1].

CROSSREFS

Cf. A282169.

Sequence in context: A217955 A325703 A321898 * A306543 A243484 A181811

Adjacent sequences:  A284431 A284432 A284433 * A284435 A284436 A284437

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 26 13:59 EST 2021. Contains 341632 sequences. (Running on oeis4.)