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 A338760 #13 Feb 06 2025 10:21:13
%S A338760 1,2,4,8,15,28,47,73,107,150,203,267,343,432,535,653,787,938,1107,
%T A338760 1295,1503,1732,1983,2257,2555,2878,3227,3603,4007,4440,4903,5397,
%U A338760 5923,6482,7075,7703,8367,9068,9807,10585,11403,12262,13163,14107,15095,16128,17207
%N A338760 Subword complexity of the infinite word Prod_{i>=1} Prod_{j=1..i} a^(i-j+1) b^j.
%C A338760 The infinite word is (ab)(aab.abb)(aaab.aabb.abbb)(aaaab.aaabb.aabbb.abbbb)... . Subword complexity is the number of distinct length-n blocks appearing in the sequence.
%H A338760 Luke Schaeffer and Kaiyo 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), Article 20.10.8.
%F A338760 Equal to 2^n for n <= 3, and n^3/6+n^2/2-5n/3+3 = A074742(n-1) for n >= 4.
%e A338760 For n=4 the only word omitted is baba.
%Y A338760 Cf. A074742, A338761.
%K A338760 nonn
%O A338760 0,2
%A A338760 _Jeffrey Shallit_, Nov 07 2020