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 A354763 #14 Jul 02 2022 14:50:53
%S A354763 0,4,7,6,9,12,8,11,14,13,10,13,16,15,18,12,15,18,17,20,23,14,17,20,19,
%T A354763 22,25,21,16,19,22,21,24,27,23,26,18,21,24,23,26,29,25,28,31,20,23,26,
%U A354763 25,28,31,27,30,33,32,22,25,28,27,30,33,29,32,35,34,31,24
%N A354763 a(n) is the minimum number of square tiles needed for constructing a figure whose corresponding graph has n cycles.
%C A354763 The square tiles are connected only at corners.
%H A354763 Stefano Spezia, <a href="/A354763/a354763_2.jpg">Illustrations for n = 1..10</a>
%F A354763 a(n) = 1 + Sum_{i=1..A057945(n)} sqrt(1 + 8*A354762(n, i)) for n > 0.
%F A354763 a(A000217(n)) = A163300(n+1).
%t A354763 r[n_]:=First[IntegerPartitions[n,All,Table[k(k+1)/2,{k,Sqrt[1+8n]}]]]; (* A354762 *)
%t A354763 Join[{0}, Table[1+Sum[Sqrt[1+8Part[r[n],i]],{i,Length[r[n]]}],{n,66}]]
%Y A354763 Cf. A000217, A057945, A163300, A354762.
%K A354763 nonn,easy
%O A354763 0,2
%A A354763 _Stefano Spezia_, Jun 06 2022