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 A225065 #14 Apr 30 2013 12:40:42 %S A225065 2,20,53,54,81,90,101,116,127,146,177,258,287,314,321,353,407,416,438, %T A225065 474,580,639,686,690,797,863,913,922,981,1045,1079,1219,1235,1259, %U A225065 1418,1493,1496,1552,1637,1783,1866,2011,2058,2063,2158,2298,2333,2422,2529 %N A225065 Numbers of the form n^2 plus the sum of squared digits of n^2. %C A225065 Note that consecutive terms are not necessarily generated by consecutive values of n. %C A225065 It appears that 146 is the only term that can be generated by two values of n (7 and 9). There are no other duplicates in the first 10000 terms. %H A225065 Christian N. K. Anderson, <a href="/A225065/b225065.txt">Table of n, a(n) for n = 1..10000</a> %e A225065 For n=11: 11^2=121; 121 + 1^2 + 2^2 + 1^2 = 127. %o A225065 (R) sort(unique((1:101)^2+sapply((1:101)^2,function(x) sum(as.numeric(unlist(strsplit(as.character(x),split="")))^2)))) %Y A225065 Cf. A176995, A062028, A209303. %K A225065 nonn,base %O A225065 1,1 %A A225065 _Kevin L. Schwartz_ and _Christian N. K. Anderson_, Apr 26 2013