This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A326778 #6 Aug 02 2019 14:04:31 %S A326778 1,2,48,24,180,300,17640,20160,22680,25200,166320,83160,4324320, %T A326778 9369360,2162160,7207200,98017920,49008960,2793510720,2095133040, %U A326778 1396755360,698377680,1847208963600,1927522396800,2007835830000,2088149263200,2168462696400,2248776129600 %N A326778 a(n) is the least k such that A213636(k) = n. %F A326778 a(n) is a multiple if A003418(n). %F A326778 a(n) mod p = n where p is the least prime number > n. %o A326778 (PARI) A213636(n) = for (d=2, oo, if (n%d, return (n%d))) %o A326778 a(n) = my (l=lcm([1..n])); forstep (x=l, oo, l, if (A213636(x)==n, return (x/l))) %Y A326778 Cf. A003418, A151800, A213636. %K A326778 nonn %O A326778 1,2 %A A326778 _Rémy Sigrist_, Jul 29 2019