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 A062379 #16 Sep 07 2020 06:29:45 %S A062379 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4,1,1, %T A062379 1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,8,1,1,1,1, %U A062379 1,1,1,1,1,1,1,1,1,1,1,2,3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4,1,1,1,1,1,1,1,1,1 %N A062379 n divided by largest 4th-power-free factor of n. %H A062379 Antti Karttunen, <a href="/A062379/b062379.txt">Table of n, a(n) for n = 1..10000</a> %H A062379 Henry Bottomley, <a href="http://fs.gallup.unm.edu/Bottomley-Sm-Mult-Functions.htm">Some Smarandache-type multiplicative sequences</a>. %F A062379 a(n) = n/A058035(n). %F A062379 Multiplicative with a(p^e) = p^max(e-3, 0). - _Amiram Eldar_, Sep 07 2020 %t A062379 f[p_, e_] := p^Max[e-3, 0]; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* _Amiram Eldar_, Sep 07 2020 *) %o A062379 (Scheme) %o A062379 (define (A062379 n) (/ n (A058035 n))) %o A062379 (define (A058035 n) (if (= 1 n) n (* (expt (A020639 n) (min 3 (A067029 n))) (A058035 (A028234 n))))) %o A062379 ;; _Antti Karttunen_, Sep 13 2017 %Y A062379 Cf. A000190, A000583, A008835, A053164, A053165, A053166, A053167, A056553, A056554, A056555, A058035. See A003557 for squares and A062378 for cubes. %K A062379 nonn,mult %O A062379 1,16 %A A062379 _Henry Bottomley_, Jun 18 2001