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.

A191345 Numbers n with property that n and 2n are sums of two distinct positive cubes.

This page as a plain text file.
%I A191345 #18 May 10 2016 09:14:16
%S A191345 728,756,2457,5824,6048,9288,14364,15561,19656,19684,20412,25327,
%T A191345 25389,39816,46592,48384,66339,70336,74304,76167,76895,82251,91000,
%U A191345 94500,114912,119574,124488,150444,152208,157248,157472,163296,202616,203112,240002,248976
%N A191345 Numbers n with property that n and 2n are sums of two distinct positive cubes.
%C A191345 Both n and 2n may be represented as a sum of two distinct positive cubes in at least one way, e.g., 19656=18^3+24^3, 2*19656=39312=2^3+34^3=15^3+33^3.
%C A191345 Which means, both n and 2n are terms in A024670 (numbers that are sums of 2 distinct positive cubes). E.g., n=728=A024670(27) and 2n=1456=A024670(48).
%C A191345 6742008 is the first n such that n and 2*n are both taxi-cab numbers (A001235). The next one is 53936064. In this sequence, there are infinitely many members such that n and 2*n are both taxi-cab numbers. - _Altug Alkan_, May 10 2016
%H A191345 Chai Wah Wu, <a href="/A191345/b191345.txt">Table of n, a(n) for n = 1..10000</a>
%t A191345 tdpcQ[n_]:=Module[{pr1=PowersRepresentations[n,2,3],pr2= PowersRepresentations[ 2n,2,3]},Length[pr1]>0&& Length[pr2]>0 && !MemberQ[Flatten[pr1],0] &&!MemberQ[Flatten[pr2],0]]; Select[Range[ 250000],tdpcQ] (* _Harvey P. Dale_, Jul 11 2014 *)
%Y A191345 Cf. A024670.
%K A191345 nonn
%O A191345 1,1
%A A191345 _Zak Seidov_, May 30 2011