# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a282164 Showing 1-1 of 1 %I A282164 #10 Feb 13 2017 20:05:55 %S A282164 1,1,2,2,4,6,12,24,48,120,240,720,1440,4320,8640,25920,60480,181440, %T A282164 483840,1451520,3870720,11612160,34836480,104509440,348364800, %U A282164 1045094400,3483648000,10450944000,38320128000,114960384000,459841536000,1379524608000,5518098432000,16554295296000 %N A282164 a(n) is the minimal product of a positive integer sequence of length n with no duplicate substrings of length greater than 1. %C A282164 a(n) = sqrt(A282165(n-1)) if A282165(n-1) is square. %H A282164 Peter Kagey, Table of n, a(n) for n = 1..100 %e A282164 a(1) = 1 via [1]; %e A282164 a(2) = 1 via [1,1]; %e A282164 a(3) = 2 via [1,1,2]; %e A282164 a(4) = 2 via [1,1,2,1]; %e A282164 a(5) = 4 via [1,1,2,2,1]; %e A282164 a(6) = 6 via [1,1,2,1,3,1]; %e A282164 a(7) = 12 via [1,1,2,2,1,3,1]; %e A282164 a(8) = 24 via [1,1,2,1,3,1,4,1]; %e A282164 a(9) = 48 via [1,1,2,2,1,3,1,4,1]; %e A282164 a(10) = 120 via [1,1,2,1,3,1,4,1,5,1]. %Y A282164 Product analog of A259280. %K A282164 nonn %O A282164 1,3 %A A282164 _Peter Kagey_, _Braxton Carrigan_, Feb 07 2017 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE