This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2
 1, 1, 2, 4, 6, 12, 36, 96, 240, 480, 1440, 5760 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS 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 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: A220423 A283021 A087902 * A180213 A081457 A261206 Adjacent sequences:  A282190 A282191 A282192 * A282194 A282195 A282196 KEYWORD nonn,more AUTHOR Peter Kagey, Feb 08 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 13 19:25 EST 2018. Contains 317149 sequences. (Running on oeis4.)