|
%I #19 Sep 02 2019 08:47:13
%S 1,2,21,16,5,6,315,24,63,20,121,12,65,14,105,320,697,306,2185,60,399,
%T 286,299,216,575,156,513,644,1189,210,837,384,231,374,1505,684,3515,
%U 1026,1131,1480,2747,966,1591,1012,1935,782,1645,1776,30429,7600,3009
%N a(n)=x is the smallest number such that gcd(prime(x)-1, x) = n.
%H Giovanni Resta, <a href="/A084313/b084313.txt">Table of n, a(n) for n = 1..10000</a> (first 4000 terms from Ivan Neretin)
%F a(n) = Min{x; A084309(x)=n}.
%t f[x_] := GCD[Prime[x]-1, x] t=Table[0, {256}]; Do[s=f[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t
%Y Cf. A084309-A084316.
%K nonn
%O 1,2
%A _Labos Elemer_, Jun 13 2003
|
