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!)
A283557 The number of positive integer sequences of length n with no duplicate substrings and a minimal product (i.e., the product of the sequence is A282164(n)). 2
1, 1, 3, 2, 2, 6, 6, 24, 24, 120 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

Peter Kagey, Examples of all sequences a(1)-a(10).

EXAMPLE

For n = 7, the a(7) = 6 sequences are

1,3,1,2,2,1,1;

1,2,2,1,3,1,1;

1,3,1,1,2,2,1;

1,1,3,1,2,2,1;

1,2,2,1,1,3,1; and

1,1,2,2,1,3,1.

CROSSREFS

Cf. A282164. A283558 is the sum analog.

Sequence in context: A272332 A197586 A111702 * A283558 A234713 A091029

Adjacent sequences:  A283554 A283555 A283556 * A283558 A283559 A283560

KEYWORD

nonn,more

AUTHOR

Peter Kagey, Mar 10 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 July 25 09:05 EDT 2021. Contains 346286 sequences. (Running on oeis4.)