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.

A359055 Numbers that can be represented in more than one way as the sum of cubes of three distinct positive numbers in arithmetic progression.

This page as a plain text file.
%I A359055 #17 Dec 16 2022 09:37:15
%S A359055 5643,12384,31977,45144,99072,123849,152361,153792,255816,259776,
%T A359055 269739,274968,334368,361152,477576,500445,705375,792576,863379,
%U A359055 912339,928017,950931,990792,1090584,1218888,1230336,1548000,1629144,1700424,1737252,1799523,1813512,1935549,1941192,2046528,2078208
%N A359055 Numbers that can be represented in more than one way as the sum of cubes of three distinct positive numbers in arithmetic progression.
%C A359055 Numbers k such that there are at least two pairs of positive numbers (a,d) such that k = a^3 + (a+d)^3 + (a+2d)^3.
%C A359055 The first term that has three such representations is 255816 = 8^3 + 34^3 + 60^3 = 18^3 + 38^3 + 58^3 = 43^3 + 44^3 + 45^3.
%C A359055 346380489216 has four such representations: 1188^3 + 3888^3 + 6588^3, 1728^3 + 4104^3 + 6480^3, 4248^3 + 4824^3 + 5400^3 and 4665^3 + 4864^3 + 5063^3. It might not be the first.
%H A359055 Robert Israel, <a href="/A359055/b359055.txt">Table of n, a(n) for n = 1..2500</a>
%H A359055 R. Israel et al, <a href="https://math.stackexchange.com/questions/4599457/sum-of-cubes-of-three-positive-integers-in-arithmetic-progression-in-four-ways">Sum of cubes of three positive integers in arithmetic progression in four ways?</a>, Mathematics StackExchange, Dec. 2022.
%e A359055 a(1) = 5643 is a term because 5643 = 1^3 + (1+8)^3 + (1+2*8)^3 = 6^3 + (6+5)^3 + (6+2*5)^3.
%p A359055 N:= 10^7: # to get terms <= N
%p A359055 S:= {}: S2:= {}:
%p A359055 for a from 1 while a^3 + (a+1)^3 + (a+2)^3 <= N do
%p A359055   for d from 1 do
%p A359055     x:= a^3 + (a+d)^3 + (a+2*d)^3;
%p A359055     if x > N then break fi;
%p A359055     if member(x,S) then S2:= S2 union {x} fi;
%p A359055     S:= S union {x}
%p A359055 od od:
%p A359055 sort(convert(S,list));
%Y A359055 Cf. A306213.
%K A359055 nonn
%O A359055 1,1
%A A359055 _Robert Israel_, Dec 14 2022