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 A229337 #8 Dec 11 2015 22:02:54
%S A229337 1,5,7,29,11,167,15,269,79,395,23,10919,27,719,767,4589,35,31919,39,
%T A229337 41579,1407,1655,47,2456999,311,2267,2239,104399,59,5499647,63,151469,
%U A229337 3263,3779,3455,76767599,75,4679,4479,15343019,83,19071359,87,372599,353279,6767
%N A229337 Sum of products of elements of nonempty subsets of divisors of n.
%C A229337 Number of nonempty subsets of divisors of n = A100587(n).
%F A229337 Let a, b, c, ..., k be all divisors of n; a(n) = (a+1) * (b+1) * ... * (k+1) - 1.
%F A229337 a(p) = 2p+1, a(p^2) = 2(p+1)(p^2+1) - 1.
%F A229337 a(n) = A020696(n) - 1.
%e A229337 For n = 2^2 = 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}; sum of products of elements of subsets = 1 + 2 + 4 + 2 + 4 + 8 + 8 = 29 = (1+1) * (2+1) * (4+1) - 1.
%Y A229337 Cf. A229335 (sum of sums of elements of nonempty subsets of divisors of n), A229336 (product of sums of elements of nonempty subsets of divisors of n), A229338 (product of products of elements of nonempty subsets of divisors of n).
%K A229337 nonn
%O A229337 1,2
%A A229337 _Jaroslav Krizek_, Sep 20 2013