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 A356208 #11 Nov 22 2023 21:34:06 %S A356208 2,3,4,4,5,7,6,8,8,9,9,10,10,12,13,12,12,15,14,17,16,16,17,18,19,18, %T A356208 19,20,18,24,20,22,25,22,27,26,23,25,25,29,26,30,27,31,32,32,24,33,33, %U A356208 34,32,32,35,37,36,37,38,32,35,44,36,41,41,40,42,45,39,43,42 %N A356208 a(n) is the number of occurrences of n in A133388. %o A356208 (Python) %o A356208 from sympy.solvers.diophantine.diophantine import diop_DN %o A356208 def A356208(n): return sum(1 for m in range(1,(n**2<<1)+1) if n==max((a for a, b in diop_DN(-1,m)),default=0)) # _Chai Wah Wu_, Sep 08 2022 %Y A356208 Cf. A000161, A001481, A133388, A356209. %K A356208 nonn %O A356208 1,1 %A A356208 _Hugo Pfoertner_, Sep 07 2022