This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A284435 #10 Jun 18 2025 00:49:07 %S A284435 1,1,2,2,4,4,4,48,144,144,144,2304,2160,8640,8640,8640,161280,806400, %T A284435 806400,806400,38534400,39168000,108864000,108864000,2794176000, %U A284435 5370624000,10741248000,21482496000,286355865600,1002245529600,2004491059200,4008982118400,61212572467200,244850289868800,489700579737600 %N A284435 The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal product (= A282193(n)). %e A284435 For n = 7 the a(7) = 4 solutions are: %e A284435 [1,3,3,2,2,1,1], %e A284435 [1,2,2,3,3,1,1], %e A284435 [1,1,3,3,2,2,1], and %e A284435 [1,1,2,2,3,3,1]. %Y A284435 Cf. A282193, A283557, A284434, A284436, A284432. %K A284435 nonn %O A284435 1,3 %A A284435 _Peter Kagey_, Mar 27 2017 %E A284435 Terms a(11) onward from _Max Alekseyev_, Feb 06 2025