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 A277065 #16 Nov 11 2016 17:51:04
%S A277065 1,9,28,73,126,252,344,585,757,135,3,325,29,417,279,802,345,1494,731,
%T A277065 207,380,27,36,909,259,261,1108,1001,738,531,29,837,84,444,621,1810,
%U A277065 371,1278,812,783,66,741,92,219,1197,324,408,1702,1137,393,498,458,153,2034,378,1854,1226,1383,855,828
%N A277065 Sum of cubes of the digits of all divisors of n.
%e A277065 For n = 10 the divisors of 10 are 1, 2, 5, 10, so a(10) = 1^3 + 2^3 + 5^3 + 1^3 + 0^3 = 1 + 8 + 125 + 1 + 0 = 135.
%e A277065 For n = 11 the divisors of 11 are 1, 11, so a(11) = 1^3 + 1^3 + 1^3 = 1 + 1 + 1 = 3.
%t A277065 Table[Total[Flatten@ IntegerDigits[Divisors@ n]^3], {n, 60}] (* _Michael De Vlieger_, Sep 27 2016 *)
%o A277065 (PARI) a(n) = sumdiv(n, d, dd = digits(d); sum(k=1, #dd, dd[k]^3)); \\ _Michel Marcus_, Sep 29 2016
%Y A277065 Cf. A055012, A276959.
%K A277065 nonn,base,easy,less
%O A277065 1,2
%A A277065 _Bhushan Bade_, Sep 27 2016
%E A277065 More terms from _Michael De Vlieger_, Sep 27 2016