|
%I #7 Feb 28 2014 09:15:35
%S 1,1,1,2,1,1,1,2,1,1,1,2,1,2,1,2,1,1,2,2,1,1,1,2,5,1,3,2,1,1,1,4,1,1,
%T 4,2,3,4,2,2,1,2,1,2,1,1,1,2,3,5,1,2,1,3,1,2,1,1,1,2,4,1,1,4,9,1,2,2,
%U 1,1,1,2,1,6,5,4,4,3,3,2,3,1,1,2,1,9,1,2,1,1,5,2,4,1,4,4,3,3,1
%N Least positive integer j such that n divides k^3-j^3, where k, as in A205787, is the least number for which there is such a j.
%C For a guide to related sequences, see A204892.
%e 1 divides 2^3-1^3 -> k=2, j=1
%e 2 divides 3^3-1^3 -> k=3, j=1
%e 3 divides 4^3-1^3 -> k=4, j=3
%e 4 divides 4^3-2^3 -> k=4, j=2
%e 5 divides 6^3-1^3 -> k=6, j=1
%t s = Table[n^3, {n, 1, 120}] ;
%t lk = Table[
%t NestWhile[# + 1 &, 1,
%t Min[Table[Mod[s[[#]] - s[[j]], z], {j, 1, # - 1}]] =!= 0 &], {z, 1,
%t Length[s]}]
%t Table[NestWhile[# + 1 &, 1,
%t Mod[s[[lk[[j]]]] - s[[#]], j] =!= 0 &], {j, 1, Length[lk]}]
%t (* _Peter J. C. Moses_, Jan 27 2012 *)
%Y Cf. A204892.
%K nonn
%O 1,4
%A _Clark Kimberling_, Feb 01 2012
|
