|
%I #25 May 06 2022 13:13:51
%S 2,4,6,6,10,12,14,10,12,20,22,18,26,28,30,20,34,24,38,30,42,44,46,30,
%T 30,52,30,42,58,60,62,36,66,68,70,42,74,76,78,50,82,84,86,66,60,92,94,
%U 60,56,60,102,78,106,60,110,70,114,116,118,90,122,124,84
%N a(n) is the least k > n such that n divides k^3.
%C A073353(n) <= a(n) <= 2*n. Any prime that divides n must also divide a(n), and because n divides (2*n)^3.
%H Peter Kagey, <a href="/A254733/b254733.txt">Table of n, a(n) for n = 1..5000</a>
%F a(n) = n + A019555(n).
%e a(8) = 10 because 8 divides 10^3, but 8 does not divide 9^3.
%o (Ruby)
%o def a(n)
%o (n+1..2*n).find { |k| k**3 % n == 0 }
%o end
%o (PARI) a(n)=for(k=n+1,2*n,if(k^3%n==0,return(k)))
%o vector(100,n,a(n)) \\ _Derek Orr_, Feb 07 2015
%Y Cf. A073353 (similar, with k^n).
%Y Cf. A254732 (similar, with k^2), A254734 (similar, with k^4).
%Y Cf. A019555 (similar without the restriction that a(n) > n).
%K nonn,easy
%O 1,1
%A _Peter Kagey_, Feb 06 2015
|
