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 A062368 #23 Sep 05 2023 01:41:55
%S A062368 1,7,7,22,7,49,7,50,22,49,7,154,7,49,49,95,7,154,7,154,49,49,7,350,22,
%T A062368 49,50,154,7,343,7,161,49,49,49,484,7,49,49,350,7,343,7,154,154,49,7,
%U A062368 665,22,154,49,154,7,350,49,350,49,49,7,1078,7,49,154,252,49,343,7,154
%N A062368 Multiplicative with a(p^e) = (e+1)*(e+2)*(4*e+3)/6.
%C A062368 Conjecture: this is the third inverse Mobius transform of the sequence 4^A001221(n). - _R. J. Mathar_, Aug 09 2012
%H A062368 Antti Karttunen, <a href="/A062368/b062368.txt">Table of n, a(n) for n = 1..16384</a>
%H A062368 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A062368 a(n) = Sum_{i|n, j|n} tau(i)*tau(j)/tau(gcd(i, j)), where tau(n) = number of divisors of n, cf. A000005.
%F A062368 Also a(n) = Sum_{i|n, j|n} tau(lcm(i, j)).
%F A062368 a(n) = Sum_{d|n} tau_3(d^2) = Sum_{d|n} A007425(d^2). - _Enrique Pérez Herrero_, Jan 17 2013
%t A062368 f[p_, e_] := (e+1)*(e+2)*(4*e+3)/6; a[n_] := Times @@ f @@@ FactorInteger[n]; a[1] = 1; Array[a, 100] (* _Amiram Eldar_, Sep 05 2023 *)
%o A062368 (Scheme, with memoization-macro definec) (definec (A062368 n) (if (= 1 n) n (let ((e (A067029 n))) (* 1/6 (+ 1 e) (+ 2 e) (+ 3 (* 4 e)) (A062368 (A028234 n)))))) ;; _Antti Karttunen_, Nov 24 2017
%Y A062368 Cf. A000005, A001221, A002412, A007425, A060648, A062380.
%K A062368 nonn,easy,mult
%O A062368 1,2
%A A062368 _Vladeta Jovovic_, Jul 07 2001