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