The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054234 Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values. 3
4, 11, 75, 108, 120, 427, 1309, 1583, 1753, 2490, 2712, 2764, 2822, 3678, 4502, 4569, 4595, 7526, 9667, 13723, 14279, 18869, 36367, 37964, 42669, 43738, 46820, 52849, 57666, 59922, 71592, 80480, 85480, 96862, 108383, 121828, 122426, 131318, 131398, 155760, 167021 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
j values are A054235 and k values are A054236
LINKS
Jon E. Schoenfield, Table of n, a(n) for n=1..41
EXAMPLE
4^3=64=2^3+binomial(6+2,3); 11^3=1331=1^3+binomial(19+2,3)
MATHEMATICA
nmax = 21;
ijk[0] = {1, 1, 0};
ijk[n_] := ijk[n] = Module[{i, j, k, r}, For[i = ijk[n-1][[1]]+1, True, i++, r = Reduce[0<j<i && k>0 && i^3 == j^3 + Binomial[k+2, 3], {j, k}, Integers]; If[r =!= False, Return[{i, j, k} /. ToRules[r]]]]];
triples = Reap[For[n=1, n<=nmax, n++, Print[ijk[n]]; Sow[ijk[n]]]][[2, 1]];
triples[[All, 1]] (* Jean-François Alcover, Jan 29 2020 *)
CROSSREFS
Sequence in context: A274960 A151826 A032110 * A213328 A181275 A000850
KEYWORD
nice,nonn
AUTHOR
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 07 2000
EXTENSIONS
More terms from Jon E. Schoenfield, Jan 19 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 07:58 EDT 2024. Contains 372538 sequences. (Running on oeis4.)