|
%I #8 Sep 27 2021 07:58:26
%S 2,3,15,14,22,39,51,38,69,87,62,74,123,86,94,106,118,122,201,142,146,
%T 158,249,178,291,202,206,214,218,226,254,262,274,278,298,302,314,326,
%U 334,346,358,362,382,386,394,398,422,446,454,458,466,478,482,502,514
%N Smallest term in A098550 having prime(n) as a factor.
%C Largest prime factor of a(n) = prime(n);
%C a(n) is composite for n > 2;
%C first column in A251637;
%C conjecture: for n > 2: a(n) = 2*prime(n) or a(n) = 3*prime(n);
%C conjecture: for n > 25: a(n) = 2*prime(n).
%H Reinhard Zumkeller, <a href="/A251618/b251618.txt">Table of n, a(n) for n = 1..1000</a>
%t nmax = 100;
%t b[n_] := b[n] = If[n <= 4, n, For[k = 1, True, k++, If[FreeQ[Array[b, n-1], k] && GCD[k, b[n-1]] == 1 && GCD[k, b[n-2]] > 1, Return[k]]]];
%t A098550 = Array[b, 12*nmax]; (* If the message Missing[NotFound] appears, the coefficient 12 in 12*nmax should be increased. *)
%t a[n_] := SelectFirst[A098550, Divisible[#, Prime[n]]&];
%t Table[a[n], {n, 1, nmax}] (* _Jean-François Alcover_, Sep 27 2021 *)
%o (Haskell)
%o import Data.List (find); import Data.Maybe (fromJust)
%o a251618 n = fromJust $
%o find (\x -> mod x (fromIntegral $ a000040 n) == 0) a098550_list
%Y Cf. A098550, A000040, A251637, A251619 (smallest prime factor), A006530.
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, Dec 07 2014
|
