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 A229895 #11 Aug 16 2024 17:01:35
%S A229895 1,1,2,2,2,2,1,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%T A229895 3,3,3,3,3,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U A229895 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4
%N A229895 k-tuple sizes in A229873.
%C A229895 Number k of elements to read from A229873 to obtain the next k-tuple.
%H A229895 Carl R. White, <a href="/A229895/b229895.txt">Table of n, a(n) for n = 1..3906</a>
%e A229895 The sequence of tuples represented in A229873 begins (1), (2), (1,1), (1,2), (2,1), (2,2), (3), so this sequence begins 1, 1, 2, 2, 2, 2, 1.
%o A229895 (bc) /* GNU bc */ for(n=1;n<=5;n++)for(k=1;k<=n;k++){if(k==n){t=n^n}else{t=n^k-(n-1)^k};for(i=1;i<=t;i++) print k,","};print "...\n"
%Y A229895 Cf. A229873, A229897.
%K A229895 nonn,easy
%O A229895 1,3
%A A229895 _Carl R. White_, Oct 03 2013