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 A338506 #9 Nov 03 2020 03:24:59
%S A338506 2,4,4,8,4,16,4,16,8,16,4,64,4,16,16,32,4,64,4,64,16,16,4,256,8,16,16,
%T A338506 64,4,256,4,64,16,16,16,512,4,16,16,256,4,256,4,64,64,16,4,1024,8,64,
%U A338506 16,64,4,256,16,256,16,16,4,4096,4,16,64,128,16,256,4,64
%N A338506 a(n) is the number of subsets of divisors of n.
%C A338506 In contrast to A100587, we take into account the empty set.
%H A338506 Rémy Sigrist, <a href="/A338506/b338506.txt">Table of n, a(n) for n = 1..10000</a>
%F A338506 a(n) = 2^A000005(n) = A100587(n) + 1.
%e A338506 For n = 6:
%e A338506 - 6 has 4 divisors,
%e A338506 - so a(n) = 2^4 = 16.
%t A338506 Table[2^DivisorSigma[0, n], {n, 68}]
%o A338506 (PARI) a(n) = 2^numdiv(n)
%Y A338506 Cf. A000005, A100587.
%K A338506 nonn,easy
%O A338506 1,1
%A A338506 _Rémy Sigrist_, Oct 31 2020