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 A356294 #17 Jun 29 2025 18:28:55
%S A356294 1,2,1,3,4,5,2,1,6,3,7,8,9,4,10,11,12,13,5,2,1,14,6,3,15,16,7,17,8,18,
%T A356294 9,19,20,21,22,4,10,23,24,11,25,26,27,28,12,29,30,31,32,33,13,5,2,1,
%U A356294 34,14,6,3,35,36,15,16,37,7,38,17,8,39,40,41,18,42,9
%N A356294 a(n) = A054633(n) if A030190(n) = 1, else a(n) = a(n-A054633(n)+1).
%H A356294 Michael De Vlieger, <a href="/A356294/b356294.txt">Table of n, a(n) for n = 1..11164</a>
%H A356294 Michael De Vlieger, <a href="/A356294/a356294.png">Log-log scatterplot of a(n)</a>, n = 1..2^20, with a color function representing the number k of appearances of m in a(n), where red represents the first appearance of m, and magenta the maximum number of appearances of m in a(1..2^20).
%t A356294 nn = 120; c = k = 1; Do[Do[Set[b[k], #[[j]]]; If[b[k] == 1, Set[a[k], c]; c++, Set[a[k], a[k - c + 1]]]; k++, {j, Length[#]}] &@ IntegerDigits[n, 2], {n, nn}]; Array[a[#] &, k - 1] (* _Michael De Vlieger_, Aug 03 2022 *)
%Y A356294 Cf. A030190, A054633.
%K A356294 nonn,easy,base,look
%O A356294 1,2
%A A356294 _Michael De Vlieger_ and _David James Sycamore_, Aug 03 2022