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 A338761 #9 Feb 06 2025 10:22:24
%S A338761 1,2,4,8,13,22,37,57,85,120,165,219,285,362,453,557,677,812,965,1135,
%T A338761 1325,1534,1765,2017,2293,2592,2917,3267,3645,4050,4485,4949,5445,
%U A338761 5972,6533,7127,7757,8422,9125,9865,10645,11464,12325,13227,14173,15162,16197
%N A338761 Subword complexity of a the infinite word Prod_{i>=1} Prod_{j=1..i} a^j b^(i-j+1).
%C A338761 The infinite word is (ab)(abb.aab)(abbb.aabb.aaab)(abbbb.aabbb.aaabb.aaaab)... . Subword complexity is the number of distinct length-n blocks appearing in the sequence.
%H A338761 Luke Schaeffer and Kaiyu Wu, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL23/Wu/wu3.html">Two Infinite Words with Cubic Subword Complexity</a>, J. Integer Sequences 23 (2020), Art. 20.10.8.
%F A338761 Equal to 2^n for n <= 3, and n^3/6-2n/3+(19+(-1)^n)/4 for n >= 4.
%e A338761 For n=4 the only subwords omitted are {abaa, baba, bbab}.
%Y A338761 Cf. A338760.
%K A338761 nonn
%O A338761 0,2
%A A338761 _Jeffrey Shallit_, Nov 07 2020