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 A136135 #9 Nov 22 2021 10:11:59 %S A136135 0,5,14,30,55,55,140,91,91,140,506,140,819,285,204,204,1785,204,2470, %T A136135 285,385,819,4324,285,385,1240,285,506,8555,385,10416,385,1015,2470, %U A136135 650,385,17575,3311,1496,506,23821,650,27434,1240,506,5525,35720,506,1015 %N A136135 Sum of squares until integer log : sopfr(n). Or also, s(s+1)(2s+1)/6 where s=sopfr(n). %C A136135 Sequence A074374 is similar, based on the triangular numbers, giving s(s+1)/2 with s=sopfr(n). Here it is based on the square pyramidal numbers, giving s(s+1)(2s+1)/6 with s=sopfr(n). %t A136135 sopfr = Function[x, Plus @@ Map[Times @@ # &, FactorInteger[x]]]; Map[ #(# + 1)(2# + 1)/6 &, sopfr /@ Range[130]] %Y A136135 Cf. A074374, A001414. %K A136135 nonn %O A136135 0,2 %A A136135 _Carlos Alves_, Dec 16 2007