A282193 a(n) is the minimal product of a positive integer sequence of length n with no duplicate substrings (forward or backward) of length greater than 1.

1, 1, 2, 4, 6, 12, 36, 96, 240, 480, 1440, 5760

Offset

1,3

Links

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

Peter Kagey, Haskell program for A282193.

Example

a(1)  = 1    via [1];
a(2)  = 1    via [1,1];
a(3)  = 2    via [1,1,2];
a(4)  = 4    via [1,1,2,2];
a(5)  = 6    via [1,1,2,3,1];
a(6)  = 12   via [1,1,2,2,3,1];
a(7)  = 36   via [1,1,2,2,3,3,1];
a(8)  = 96   via [1,1,2,2,3,1,4,2];
a(9)  = 240  via [1,1,2,2,3,1,4,5,1];
a(10) = 480  via [1,1,2,2,3,1,4,2,5,1];
a(11) = 1440 via [1,1,2,2,3,3,1,4,2,5,1];
a(12) = 5760 via [1,1,2,2,3,1,4,2,5,1,6,2].
...
[1,2,3,1,2] is invalid because the substring [1,2] appears twice.
[1,2,1] is invalid because the substring [1,2] appears twice (once forward and once backward).

Crossrefs

Cf. A282168 is the sum analog.

Cf. A282164, A282169, A282170.

Sequence in context: A283021 A309039 A087902 * A180213 A081457 A261206

Adjacent sequences: A282190 A282191 A282192 * A282194 A282195 A282196

Keyword

nonn,more

Author

Peter Kagey, Feb 08 2017

Status

approved