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 A366993 #7 Nov 02 2023 10:26:37
%S A366993 1,1,1,4,1,1,1,8,9,1,1,4,1,1,1,8,1,9,1,4,1,1,1,8,25,1,27,4,1,1,1,32,1,
%T A366993 1,1,36,1,1,1,8,1,1,1,4,9,1,1,8,49,25,1,4,1,27,1,8,1,1,1,4,1,1,9,32,1,
%U A366993 1,1,4,1,1,1,72,1,1,25,4,1,1,1,8,27,1,1,4
%N A366993 The largest divisor of n that is a term of A056166.
%C A366993 The number of these divisors is A095691(n) and their sum is A366990(n).
%H A366993 Amiram Eldar, <a href="/A366993/b366993.txt">Table of n, a(n) for n = 1..10000</a>
%F A366993 Multiplicative with a(p) = 1 and a(p^e) = p^A007917(e).
%F A366993 a(n) <= n, with equality if and only if n is in A056166.
%F A366993 a(n) >= 1, with equality if and only if n is squarefree (A005117).
%t A366993 f[p_, e_] := p^If[e == 1, 0, NextPrime[e+1, -1]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A366993 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^precprime(f[i, 2]));}
%Y A366993 Cf. A005117, A007917, A056166, A095691, A366988, A366990.
%K A366993 nonn,easy,mult
%O A366993 1,4
%A A366993 _Amiram Eldar_, Oct 31 2023