cp's OEIS Frontend

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.

A282639 Greater value of a coprime pair (x,y) satisfying x^3+y^3=z^2.

This page as a plain text file.
%I A282639 #13 Jan 23 2025 04:31:19
%S A282639 2,37,65,112,312,433,877,1064,1177,1201,1617,1969,2345,2480,2543,3081,
%T A282639 3482,4019,4440,5160,5985,6337,6489,7729,8663,8848,9265,10274,10753,
%U A282639 11821,12071,12688,13937,14345,15520,15962,16296,16352,17761,21923,22753,26208
%N A282639 Greater value of a coprime pair (x,y) satisfying x^3+y^3=z^2.
%C A282639 A permutation of A099533 sorted by increasing y. 1<=x<=y, GCD(x,y)=1.
%H A282639 R. J. Mathar, <a href="/A282639/b282639.txt">Table of n, a(n) for n = 1..325</a>
%e A282639 (x,y,z) = (11,37,228), (56,65,671), (57,112,1261), (217,312,6371), (242,433,9765), (851,877,35928), (305,1064,35113), (23,1177,40380), (122,1201,41643), (592,1617,66599), (1706,1969,112245), (1376,2345,124501), (1001,2480,127499), (2257,2543,167160), (1960,3081,191771)... - _R. J. Mathar_, Jan 22 2025
%p A282639 A282639 := proc(n)
%p A282639     option remember ;
%p A282639     local x,y ;
%p A282639     if n =1 then
%p A282639         2
%p A282639     else
%p A282639         for y from procname(n-1)+1 do
%p A282639             for x from 1 to y do
%p A282639                 if igcd(x,y) = 1 then
%p A282639                     if issqr(x^3+y^3) then
%p A282639                         return y;
%p A282639                     end if;
%p A282639                 end if;
%p A282639             end do:
%p A282639         end do:
%p A282639     end if;
%p A282639 end proc:
%p A282639 seq(A282639(n),n=1..17) ; # _R. J. Mathar_, Jan 22 2025
%Y A282639 Cf. A099533, A106322, A099426 (values of z). Subsequence of A320662.
%K A282639 nonn
%O A282639 1,1
%A A282639 _R. J. Mathar_, Feb 20 2017