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.

A268583 Happycab numbers: the smallest happy number that is the sum of two cubes of happy numbers in n different ways.

This page as a plain text file.
%I A268583 #12 Feb 07 2016 20:07:04
%S A268583 7859,681179092750,4466203788801326865111
%N A268583 Happycab numbers: the smallest happy number that is the sum of two cubes of happy numbers in n different ways.
%C A268583 a(n)>3.6*10^24 for n >=4. This lower bound was established by exhaustive crowd computing.
%C A268583 Upper bounds:
%C A268583 a(4)<= 3915335521240189321820073984
%C A268583 =467175960^3+1562319144^3
%C A268583 =569783808^3+1550898288^3
%C A268583 =1085420968^3+1381483928^3
%C A268583 =1157553216^3+1332193392^3
%C A268583 a(5)<=
%C A268583 1508202165690304620654479410485250200981504
%C A268583 =12156471201588^3+114634141265868^3
%C A268583 =33798481396036^3+113692639229372^3
%C A268583 =64341822928208^3+107486686558048^3
%C A268583 =69397851840576^3+105492106344912^3
%C A268583 =72561474196232^3+104039736026296^3
%e A268583 a(1) = 7859 = 10^3+19^3;
%e A268583 a(2) = 681179092750 = 4365^3+8425^3 = 5275^3+8115^3;
%e A268583 a(3) = 4466203788801326865111 = 6193863^3+16170804^3 = 8456292^3+15688647^3 = 9457695^3+15354846^3.
%Y A268583 Cf. A011541, A007770.
%K A268583 nonn,hard,more,bref
%O A268583 1,1
%A A268583 _Corinna Regina Böger_, Feb 07 2016