|
%I #66 Dec 15 2018 20:43:41
%S 0,1,8,28,108,189,324,648,972,756,1701,2457,1512,3888,2268,4536,6048,
%T 13104,10584,15120,6804,16848,9072,14364,9828,28728,19656,21168,36288,
%U 31752,50544,27216,46683,70308,29484,57456,39312,81648,111132,63504,58968,108864
%N Smallest k such that A261029(k) = n.
%C Theorem. For every n>=0, a(n) exists.
%C Are all terms from a(4)=108 onward divisible by 9?
%C a(139) = 12006176 is not divisible by 9. - _Chai Wah Wu_, Aug 25 2015
%H Chai Wah Wu, <a href="/A260935/b260935.txt">Table of n, a(n) for n = 0..698</a>
%H Vladimir Shevelev, <a href="http://arxiv.org/abs/1508.05748">Representation of positive integers by the form x^3+y^3+z^3-3xyz</a>, arXiv:1508.05748 [math.NT], 2015.
%H Robert G. Wilson v, <a href="/A260935/a260935.txt">For n: solutions of A261029(k).</a>
%F A261029(a(n)) = n.
%F For n>=1, a(n) <= 8^(n-1).
%e By condition z>=x+1>=1. By induction one can prove that F(x,y,z)>=3*z-2 (cf.[Shevelev]).
%e Since F>=1, then A261029(0)=0 and a(0)=0;
%e Further,
%e x y z F
%e 0 0 1 1
%e 0 1 1 2
%e Since F(x,y,2)>=4>1, A261029(1)=1 and a(1)=1.
%e 0 0 2 8
%e 0 1 2 9
%e 0 2 2 16
%e 1 1 2 4
%e 1 2 2 5
%e 0 0 3 27
%e 0 1 3 28
%e 0 2 3 35
%e 0 3 3 54
%e 1 1 3 20
%e 1 2 3 18
%e 1 3 3 28
%e 2 2 3 7
%e 2 3 3 8
%e Since F(x,y,4)>=10>8, A261029(8)=2 and a(2)=8,
%e etc.
%t r[n_] := Reduce[0 <= x <= y <= z && z >= x + 1 && n == x^3 + y^3 + z^3 - 3 x y z, {x, y, z}, Integers];
%t a29[n_] := a29[n] = Which[rn = r[n]; rn === False, 0, rn[[0]] === And, 1, rn[[0]] === Or, Length[rn], True, Print["error ", rn]];
%t a[n_] := For[k=0, True, k++, If[a29[k] == n, Print[n, " ", k]; Return[k]]];
%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Dec 15 2018 *)
%Y Cf. A261029.
%K nonn
%O 0,3
%A _Vladimir Shevelev_ and _Peter J. C. Moses_, Aug 22 2015
%E a(11)-a(41) from _Chai Wah Wu_, Aug 25 2015
|
