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 A306333 #11 Feb 09 2019 02:32:23 %S A306333 1,1,2,1,1,1,1,3,1,1,4,1,3,1,1,4,1,3,1,3,1,3,1,1,4,1,3,1,3,1,3,1,3,1, %T A306333 3,1,3,1,3,1,1,4,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3, %U A306333 1,3,1,3,1,1,4,1,3,1,3,1,3,1,3,1,3,1,3 %N A306333 Last term in each generation of A306211. %C A306333 The first 65 generations of A306211 were computed explicitly. Since the tail of each generation is the RUNS of the tail of the previous generation, if we start with a complete generation then we can get just the tail of some further generations by iterating RUNS on it. This allowed the computation of the remaining 55 terms. %C A306333 Generations 11, 16, 25, 42, and 75 end in a 4. The number of generations in between those which end in a 4 is thus 4, 8, 16, 32. %H A306333 Benjamin Chaffin, <a href="/A306333/b306333.txt">Table of n, a(n) for n = 1..120</a> %Y A306333 Cf. A306211. %K A306333 nonn %O A306333 1,3 %A A306333 _Benjamin Chaffin_, Feb 08 2019