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 A378058 #11 Nov 15 2024 12:56:18
%S A378058 1,60,210,360,420,504,630,660,840,924,1092,1260,1320,1560,1848,1980,
%T A378058 2184,2310,2520,2640,2772,3080,3120,3276,3465,3960,4080,4284,4620,
%U A378058 4680,5320,5460,5544,6006,6552,6732,6840,6864,6930,7140,7800,7854,7920,8190,8280,8568,8580,9240,9360,9828
%N A378058 Numbers k that divide A378056(k) = gcd(lcm{d+1 : d|k}, lcm{d-1 : d > 1 and d|k}).
%C A378058 After the first term a(1) = 1, the next odd term is a(25) = 3465, the next term that is coprime to 6 is a(308) = 95095, and the next term that is coprime to 30 is a(13544) = 10023013.
%H A378058 Amiram Eldar, <a href="/A378058/b378058.txt">Table of n, a(n) for n = 1..10000</a>
%e A378058 60 is a term since A378056(60) = 4620 = 60 * 77 is divisible by 60.
%t A378058 s[n_] := Module[{d = Divisors[n]}, GCD[LCM @@ (d + 1), LCM @@ (Rest @ d - 1)]]; s[1] = 1; Select[Range[10000], Divisible[s[#], #] &]
%o A378058 (PARI) is(k) = {my(d = divisors(k)); !(lcm(apply(x->x+1, d)) % k) && !(lcm(apply(x -> if(x > 1, x-1, x), d)) % k);}
%Y A378058 Intersection of A377950 and A377952.
%Y A378058 A378059 is a subsequence.
%Y A378058 Cf. A378056, A378054.
%K A378058 nonn
%O A378058 1,2
%A A378058 _Amiram Eldar_, Nov 15 2024