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 A356334 #33 Sep 21 2022 21:24:44 %S A356334 1,3,4,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3 %N A356334 a(n) is the number of nonnegative integer solutions (x; y) with x <= y of x^(n+1) + y^(n+1) = (x+y)^n. %C A356334 Conjecture: a(n) = 3 except for n = 0 or n = 2. - _Chai Wah Wu_, Sep 21 2022 %e A356334 For n=2, the 4 solutions are (0; 0), (0; 1), (1; 2) and (2; 2). The pairs (0; 0), (0; 1) and (2^(n-1); 2^(n-1)) exist for all n > 0. %o A356334 (Python) %o A356334 def A356334(n): return sum(1 for x in range((1<<n)+1) for y in range(x,(1<<n)+1) if x**(n+1)+y**(n+1)==(x+y)**n) # _Chai Wah Wu_, Sep 19 2022 %K A356334 nonn,more %O A356334 0,2 %A A356334 _Reiner Moewald_, Aug 04 2022 %E A356334 a(11)-a(14) from _Hugo Pfoertner_, Sep 18 2022 %E A356334 a(15)-a(20) from _Chai Wah Wu_, Sep 21 2022