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 A135910 #9 Mar 13 2023 10:20:01 %S A135910 1,3,3,1,1,2,1,0,1,3,3,1,1,1,0,0,2,5,3,0,1,1,0,0,2,4,3,2,3,1,0,1,2,3, %T A135910 1,0,2,3,1,0,1,1,1,2,3,1,0,1,0,2,2,1,3,2,0,0,0,1,1,1,1,0,0,1,3,5,3,0, %U A135910 2,1,0,0,1,3,1,0,1,1,0,1,3,5,4,2,1,1,1,0,1,4,4,2,2,1,0,0,1,2,3,0,2 %N A135910 Number of triples (x,y,z) of nonnegative integers such that x^2+y^3+z^4 = n. %H A135910 T. D. Noe, <a href="/A135910/b135910.txt">Table of n, a(n) for n = 0..10000</a> %H A135910 K. B. Ford, <a href="https://doi.org/10.1090/S0894-0347-96-00193-2">The representation of numbers as sums of unlike powers II</a>, J. Amer. Math. Soc., 9 (1996), 919-940. %p A135910 M:=10; M2:=M^2; t0:=array(0..M2); %p A135910 for i from 0 to M2 do t0[i]:=0; od: %p A135910 for a from 0 to M do for b from 0 to M do for c from 0 to M do %p A135910 i:=a^2+b^3+c^4; if i <= M2 then t0[i]:=t0[i]+1; fi; %p A135910 od: od: od: [seq(t0[i],i=0..M2)]; %Y A135910 Cf. A045634, A135911, A135912. %K A135910 nonn %O A135910 0,2 %A A135910 _N. J. A. Sloane_, Mar 07 2008