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 A166648 #17 Feb 06 2025 08:22:27
%S A166648 1,24,32,576,48,768,64,13824,1024,1152,96,18432,112,1536,1536,331776,
%T A166648 144,24576,160,27648,2048,2304,192,442368,2304,2688,32768,36864,240,
%U A166648 36864,256,7962624,3072,3456,3072,589824,304,3840,3584,663552,336,49152
%N A166648 Totally multiplicative sequence with a(p) = 8*(p+1) for prime p.
%H A166648 G. C. Greubel, <a href="/A166648/b166648.txt">Table of n, a(n) for n = 1..10000</a>
%F A166648 Multiplicative with a(p^e) = (8*(p+1))^e. If n = Product p(k)^e(k) then a(n) = Product (8*(p(k)+1))^e(k).
%F A166648 a(n) = A165829(n) * A003959(n) = 8^bigomega(n) * A003959(n) = 8^A001222(n) * A003959(n).
%t A166648 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n]*8^(PrimeOmega[n]), {n, 1, 100}] (* _G. C. Greubel_, May 21 2016 *)
%t A166648 f[p_, e_] := (8*(p+1))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 17 2023 *)
%o A166648 (PARI) a(n) = {my(f = factor(n)); for (k=1, #f~, f[k,1] = 8*(f[k,1]+1)); factorback(f);} \\ _Michel Marcus_, May 21 2016
%Y A166648 Cf. A001222, A003959, A165829.
%K A166648 nonn,easy,mult
%O A166648 1,2
%A A166648 _Jaroslav Krizek_, Oct 18 2009