|
%I #7 Apr 23 2013 00:12:55
%S 1,2,1,2,2,2,1,2,2,2,1,2,1,2,2,2,1,2,1,2,1,2,1,2,2,2,2,2,2,2,1,2,1,2,
%T 2,2,1,2,2,2,1,2,1,2,2,2,1,2,1,2,1,2,1,2,2,2,1,2,1,2,1,2,2,2,2,2,1,2,
%U 2,2,1,2,1,2,2,2,1,2,1,2,2,2,1,2,2,2,2,2,2,2,1,2,1,2,2,2,1,2,2
%N Least m>0 such that 4^n-m and 5^n-m are relatively prime.
%C a(248) = 3. Is every term < 4?
%H Clark Kimberling, <a href="/A214708/b214708.txt">Table of n, a(n) for n = 1..1000</a>
%e gcd(256-1,625-1) = 3 and gcd(256-2, 625-2) = 1, so a(4) = 2.
%t Table[m = 1; While[GCD[4^n - m, 5^n - m] != 1, m++]; m, {n, 1, 140}]
%Y Cf. A214074, A214707.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Jul 27 2012
|
