|
%I #25 May 07 2021 08:08:08
%S 1,1,1,2,1,2,1,4,3,2,1,3,1,2,3,8,1,2,1,4,3,2,1,6,5,2,9,4,1,3,1,16,3,2,
%T 5,4,1,2,3,8,1,6,1,4,9,2,1,12,7,10,3,4,1,6,5,7,3,2,1,6,1,2,7,32,5,2,1,
%U 4,3,2,1,8,1,2,15,4,7,6,1,16,27,2,1,3,5,2,3,8,1,9,7,4,3,2,5,3,1,2,9,20,1,6,1,8,3,2,1,12,1,10,3,14,1,6,5,4,9
%N a(n) = gcd(n, A079277(n)), a(1) = 1.
%H Antti Karttunen, <a href="/A285707/b285707.txt">Table of n, a(n) for n = 1..10000</a>
%F a(1) = 1; for n > 1, a(n) = gcd(n, A079277(n)) = gcd(n, A285699(n)).
%F a(n) = n / A285708(n).
%t Table[GCD[n, #] &@ If[n <= 2, 1, Module[{k = n - 2, e = Floor@ Log2@ n}, While[PowerMod[n, e, k] != 0, k--]; k]], {n, 117}] (* _Michael De Vlieger_, Apr 26 2017 *)
%o (PARI)
%o A007947(n) = factorback(factorint(n)[, 1]);
%o A079277(n) = { my(r); if((n > 1 && !bitand(n,(n-1))), (n/2), r=A007947(n); if(1==n,0,k = n-1; while(A007947(k*n) <> r, k = k-1); k)); };
%o A285707(n) = if(1==n,n,gcd(A079277(n),n));
%o (Scheme) (define (A285707 n) (if (= 1 n) n (gcd n (A079277 n))))
%o (Python)
%o from sympy import divisors, gcd
%o from sympy.ntheory.factor_ import core
%o def a007947(n):
%o return max(i for i in divisors(n) if core(i) == i)
%o def a079277(n):
%o k=n - 1
%o while True:
%o if a007947(k*n) == a007947(n): return k
%o else: k-=1
%o def a(n): return 1 if n==1 else gcd(n, a079277(n))
%o print([a(n) for n in range(1, 151)]) # _Indranil Ghosh_, Apr 26 2017
%Y Cf. A009195, A079277, A285699, A285708, A285711.
%K nonn,look
%O 1,4
%A _Antti Karttunen_, Apr 26 2017
|
