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 A045967 #25 Aug 11 2022 08:55:01
%S A045967 4,9,25,27,49,225,121,81,125,441,169,675,289,1089,1225,243,361,1125,
%T A045967 529,1323,3025,1521,841,2025,343,2601,625,3267,961,11025,1369,729,
%U A045967 4225,3249,5929,3375,1681,4761,7225,3969,1849,27225,2209,4563,6125,7569,2809,6075
%N A045967 a(1)=4; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+1}.
%C A045967 If we had a(1) = 1 (instead of 4), then this would be multiplicative and a permutation of the odd powerful numbers (A062739). - _Amiram Eldar_, Aug 11 2022
%D A045967 From a puzzle proposed by _Marc LeBrun_.
%H A045967 Reinhard Zumkeller, <a href="/A045967/b045967.txt">Table of n, a(n) for n = 1..10000</a>
%F A045967 Sum_{n>=1} 1/a(n) = 2*zeta(2)*zeta(3)/(3*zeta(6)) - 3/4. - _Amiram Eldar_, Aug 11 2022
%t A045967 a[1]=4; a[n_] := Thread[f = FactorInteger[n]; Times @@ Power[f[[All, 1]] // NextPrime , f[[All, 2]] + 1]]; Array[a, 50] (* _Jean-François Alcover_, Feb 03 2015 *)
%o A045967 (Haskell)
%o A045967 a045967 1 = 4
%o A045967 a045967 n = product $ zipWith (^)
%o A045967 (map a151800 $ a027748_row n) (map (+ 1) $ a124010_row n)
%o A045967 -- _Reinhard Zumkeller_, Jun 03 2013, Dec 23 2011
%Y A045967 Cf. A045966, A027748, A062739, A124010, A000040.
%Y A045967 Cf. A151800.
%K A045967 easy,nonn,nice
%O A045967 1,1
%A A045967 _N. J. A. Sloane_
%E A045967 More terms from _David W. Wilson_