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 A124511 #15 Jul 11 2023 03:38:48 %S A124511 1,36,36,72,36,144,36,144,72,144,36,288,36,144,144,288,36,288,36,288, %T A124511 144,144,36,576,72,144,144,288,36,576,36,576,144,144,144,576,36,144, %U A124511 144,576,36,576,36,288,288,144,36,1152,72,288,144,288,36,576,144,576,144 %N A124511 a(n) = A124508(A124508(n)). %H A124511 Amiram Eldar, <a href="/A124511/b124511.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Reinhard Zumkeller) %F A124511 a(n) = A124512(n) / 4 for n > 1. %F A124511 A124512(n) = A124508(a(n)). %F A124511 For primes p, q with p <> q: a(p) = 36; a(p*q) = 144; a(p^k) = 9*2^(k+1) = 6*A124508(n), k > 0. %F A124511 a(n) = 9 * 2^(omega(n) + Omgea(n)) = 9 * 2^(A001221(n) + A001222(n)), for n >= 2. - _Amiram Eldar_, Jul 11 2023 %t A124511 a[n_] := 9 * 2^(PrimeNu[n] + PrimeOmega[n]); a[1] = 1; Array[a, 100] (* _Amiram Eldar_, Jul 11 2023 *) %o A124511 (PARI) a(n) = my(f = factor(n)); if(n == 1, 1, 9 * 2^(omega(f) + bigomega(f))); \\ _Amiram Eldar_, Jul 11 2023 %Y A124511 Cf. A001221, A001222, A003586, A124508, A124512. %K A124511 nonn,easy %O A124511 1,2 %A A124511 _Reinhard Zumkeller_, Nov 04 2006