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 A334081 #20 May 24 2021 00:08:20 %S A334081 1,2,1,3,4,2,1,5,3,2,1,6,4,7,8,5,3,2,1,9,6,4,10,7,11,12,8,5,3,2,1,13, %T A334081 9,6,4,14,10,7,5,3,2,1,15,11,8,6,4,3,2,1,16,12,9,7,5,17,13,10,18,14, %U A334081 19,20,15,11,8,6,4,3,2,1,21,16,12,9,7,5,22,17,13,10,23,18,14,11,8,6,4,3,2,1 %N A334081 If the terms of this sequence are divided into groups, the lengths of which are the terms of this sequence, the k-th term in a group is one greater than the k-th term in the previous group with at least k terms or 1 if no such group exists. %H A334081 Samuel B. Reid, <a href="/A334081/b334081.txt">Table of n, a(n) for n = 1..10000</a> %H A334081 Samuel B. Reid, <a href="/A334081/a334081.py.txt">Python program for A334081</a> %e A334081 -------------------- %e A334081 n a(n) n-th Group %e A334081 -------------------- %e A334081 1 1 [1] %e A334081 2 2 [2,1] %e A334081 3 1 [3] %e A334081 4 3 [4,2,1] %e A334081 5 4 [5,3,2,1] %e A334081 6 2 [6,4] %e A334081 7 1 [7] %e A334081 8 5 [8,5,3,2,1] %e A334081 9 3 [9,6,4] %o A334081 (Python) # See Links section. %Y A334081 Cf. A000002, A332864. %K A334081 nonn,look,tabf %O A334081 1,2 %A A334081 _Samuel B. Reid_, Apr 14 2020