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 A300564 #11 Apr 20 2018 16:51:47 %S A300564 6,9,15,35,36,42,48,57,63,71,72,75,78,90,98,100,120,135,141,147,162, %T A300564 195,196,204,208,215,225,243,252,260,279,280,288,289,295,300,306,336, %U A300564 363,364,384,405,441,450,456,462,504,510,525,537,550,568,576,600,624,630,713,720,722,735,750,784,800,819,828,841,845,847,867,875 %N A300564 Numbers z such that there is a solution to x^2 + y^3 = z^4 with x, y, z >= 1. %F A300564 Equals sequence A242183 with duplicates removed. %o A300564 (PARI) is(z)=for(y=1,sqrtnint(z^4,3),issquare(z^4-y^3,&x)&&x&&return(1)) %Y A300564 Cf. A242183, A242192, A300565 (z^5 = x^3 + x^4), A300566 (z^6 = x^4 + y^5). %K A300564 nonn %O A300564 1,1 %A A300564 _M. F. Hasler_, Apr 16 2018