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 A283557 #22 Feb 06 2025 21:32:43
%S A283557 1,1,3,2,2,6,6,24,24,120,120,1200,1440,4320,4320,8640,30240,60480,
%T A283557 483840,967680,1935360,3870720,17418240,34836480,348364800,696729600,
%U A283557 1741824000,3483648000,19160064000,38320128000,689762304000,1379524608000,9656672256000,16554295296000,66217181184000
%N A283557 The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal product (= A282164(n)).
%C A283557 Surprisingly, a(n) = A282164(n) for n in { 1, 2, 4, 6, 8, 10, 13, 14, 19, 25, 32, 34, 35, ... }. - _Max Alekseyev_, Feb 06 2025
%H A283557 Peter Kagey, <a href="/A283557/a283557.txt">Examples of all sequences a(1)-a(10)</a>.
%e A283557 For n = 7, the a(7) = 6 sequences are
%e A283557 1,3,1,2,2,1,1;
%e A283557 1,2,2,1,3,1,1;
%e A283557 1,3,1,1,2,2,1;
%e A283557 1,1,3,1,2,2,1;
%e A283557 1,2,2,1,1,3,1; and
%e A283557 1,1,2,2,1,3,1.
%Y A283557 A283558 is the sum analog.
%Y A283557 Cf. A282164, A284434, A284435, A284436.
%K A283557 nonn
%O A283557 1,3
%A A283557 _Peter Kagey_, Mar 10 2017
%E A283557 Terms a(11) onward from _Max Alekseyev_, Feb 06 2025