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 A372468 #7 May 02 2024 10:06:35 %S A372468 1,2,2,2,4,2,4,4,2,2,4,4,2,2,4,4,2,8,4,4,2,8,2,4,4,4,2,4,4,8,2,8,2,4, %T A372468 2,4,2,8,4,8,4,4,2,2,4,4,8,2,4,8,2,2,4,4,8,2,4,2,4,4,4,8,2,4,4,4,4,2, %U A372468 2,8,2,8,8,4,2,2,8,4,2,8,4,4,4,16,4,4,4 %N A372468 The number of divisors of the numbers whose number of divisors is a power of 2 (A036537). %C A372468 Also, the number of infinitary divisors of the numbers whose number of divisors is a power of 2. %H A372468 Amiram Eldar, <a href="/A372468/b372468.txt">Table of n, a(n) for n = 1..10000</a> %F A372468 a(n) = A000005(A036537(n)). %F A372468 a(n) = A037445(A036537(n)). %F A372468 a(n) = A372470(A036537(n)). %F A372468 a(n) = 2^A372469(n). %t A372468 Select[DivisorSigma[0, Range[300]], # == 2^IntegerExponent[#, 2] &] %o A372468 (PARI) lista(n) = select(x -> x >> valuation(x, 2) == 1, vector(n, i, numdiv(i))); %Y A372468 Cf. A000005, A036537, A037445, A372469, A372470. %K A372468 nonn,easy %O A372468 1,2 %A A372468 _Amiram Eldar_, May 02 2024