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 A264786 #20 Jan 01 2016 08:09:39
%S A264786 1,3,4,9,6,24,8,33,19,44,12,226,14,72,68,161,18,429,20,534,98,152,24,
%T A264786 3858,51,204,136,856,30,6534,32,1089,182,332,210,22965,38,408,236,
%U A264786 12886,42,14262,44,2148,1868,584,48,128338,99,2333,368,3214,54,21810,302
%N A264786 Let { d_1, d_2, ..., d_k } be the divisors of n. Then a(n) = d_k^1 + d_(k-1)^2 + ... + d_1^k.
%H A264786 Carlos Eduardo Olivieri, <a href="http://oeis.org/wiki/User:Carlos_Eduardo_Olivieri/ideas/polyfromdivisors">A polynomial from divisors of n</a>
%e A264786 For n = 4: a(4) = 4^1 + 2^2 + 1^3 = 9.
%e A264786 For n = 5: a(5) = 5^1 + 1^2 = 6.
%e A264786 For n = 6: a(6) = 6^1 + 3^2 + 2^3 + 1^4 = 24.
%t A264786 a[n_] := Sum[Sort[Divisors[n], #1 > #2 &][[i]]^i, {i, DivisorSigma[0, n]}]; Table[a[n], {n, 60}]
%o A264786 (PARI) a(n) = my(d = divisors(n)); sum(k=1, #d, d[k]^(#d-k+1)); \\ _Michel Marcus_, Jan 01 2016
%Y A264786 Cf. A027750, A180851.
%K A264786 nonn,easy
%O A264786 1,2
%A A264786 _Carlos Eduardo Olivieri_, Nov 29 2015