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 A343265 #23 May 07 2021 09:19:50
%S A343265 1,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,5,5,5,5,5,5,5,5,5,7,7,7,7,7,7,7,7,7,
%T A343265 7,7,9,9,9,9,9,9,9,9,9,9,9,9,9,11,11,11,11,11,11,11,11,11,11,11,11,11,
%U A343265 11,11,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13
%N A343265 a(n) is the number of ways n can be reached starting from 0 and using only two operations: adding one or, once n > 1, squaring.
%F A343265 a(n) = a(n-1) + a(sqrt(n)) if n is a square or a(n-1) otherwise.
%t A343265 a[0]:=1; a[n_]:=If[IntegerQ[Sqrt[n]],a[n-1]+a[Sqrt[n]],a[n-1]]; Table[a[n],{n,0,80}] (* _Stefano Spezia_, May 06 2021 *)
%Y A343265 Cf. A097046.
%K A343265 nonn
%O A343265 0,5
%A A343265 _James P. B. Hall_, Apr 09 2021