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 A229253 #16 May 26 2017 03:16:08
%S A229253 1,4,4,12,4,32,4,32,12,32,4,192,4,32,32,80,4,192,4,192,32,32,4,1024,
%T A229253 12,32,32,192,4,1024,4,192,32,32,32,2304,4,32,32,1024,4,1024,4,192,
%U A229253 192,32,4,5120,12,192,32,192,4,1024,32,1024,32,32,4,24576,4,32,192
%N A229253 Total number of elements of nonempty subsets of divisors of n.
%C A229253 Number of nonempty subsets of divisors of n = A100587(n).
%H A229253 Antti Karttunen, <a href="/A229253/b229253.txt">Table of n, a(n) for n = 1..10000</a>
%F A229253 a(n) = A001787(A000005(n)) = A000005(n) * 2^(A000005(n)-1) = A100587(n) + A000337(n-1) = tau(n) * 2^(tau(n)-1).
%e A229253 For n = 4; divisors of 4: {1, 2, 4}; nonempty subsets of divisors of n: {1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {1, 2, 4}; total number of elements of subsets = 1 + 1 + 1 + 2 + 2 + 2 + 3 = 12.
%p A229253 with(numtheory): A229253:=n->tau(n)*2^(tau(n)-1): seq(A229253(n), n=1..100); # _Wesley Ivan Hurt_, Dec 12 2015
%t A229253 Table[Length[Flatten[Subsets[Divisors[n]]]], {n, 100}] (* _T. D. Noe_, Oct 01 2013 *)
%o A229253 (PARI) A229253(n) = numdiv(n) * 2^(numdiv(n)-1); \\ _Antti Karttunen_, May 25 2017
%Y A229253 Cf. A000005, A000337, A001787, A003506, A100587.
%K A229253 nonn,easy
%O A229253 1,2
%A A229253 _Jaroslav Krizek_, Sep 29 2013