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 A329338 #24 Nov 14 2019 13:54:04
%S A329338 1,110,101010,111100,100010001000100010,1111110,
%T A329338 10000010000010000010000010000010000010,11111111000,
%U A329338 1010101010101010100,10101010101010101010,100000000010000000001000000000100000000010000000001000000000100000000010000000001000000000100000000010
%N A329338 a(n) = {1{0}^(A268336(n)-1)}^(n-1){1}{0}^A051903(n): upper bound for A329126(n).
%C A329338 This is the upper bound for A329126 as explained in the "FORMULA" there.
%C A329338 It is sharp for all n except 10, 14, 15, ...
%F A329338 a(n) = A007088(A329339(n)), where A007088 = binary numbers and A329339(n) = 2^A051903(n)*(m^n-1)/(m-1) with m = 2^A268336(n).
%o A329338 (PARI) apply( {A329338(n)=my(k=lcm(lcm([p-1|p<-factor(n)[,1]]), n)/n); fromdigits(concat(vector(n, i, Vec(1, if(i<n, k, n>1, vecmax(factor(n)[,2])+1)))))}, [1..16])
%Y A329338 Cf. A329126, A329000, A329339 (this converted from binary to decimal), A268336, A051903.
%K A329338 nonn
%O A329338 1,2
%A A329338 _M. F. Hasler_, Nov 13 2019