|
%I #4 Jul 29 2012 14:00:35
%S 1,2,1,3,1,2,1,2,1,3,1,2,1,2,3,3,1,2,1,2,1,3,1,2,1,2,1,3,1,2,1,2,1,3,
%T 3,2,1,2,3,3,1,2,1,2,3,3,1,2,1,2,1,3,1,2,1,2,1,3,1,2,1,2,1,3,1,2,1,2,
%U 1,3,1,2,1,2,3,3,1,2,1,2,1,3,1,2,1,2,1,3,1,2,1,2,1,3,3,2,1,2,3
%N Least m>0 such that 2^n-m and 5^n-m are relatively prime.
%C a(616) = 5.
%H Clark Kimberling, <a href="/A214180/b214180.txt">Table of n, a(n) for n = 1..1000</a>
%e gcd(16-1,625-1) = 3, gcd(16-2,625-2) = 7, gcd(16-3,625-3) = 1, so a(4) = 3.
%t Table[m = 1; While[GCD[2^n - m, 5^n - m] != 1, m++]; m, {n, 1, 140}]
%Y Cf. A214074, A214708.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Jul 27 2012
|
