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 A290934 #20 May 30 2022 16:33:11 %S A290934 1,4,9,16,25,36,49,64,81,25,25,100,100,9,81,81,9,9,49,36,49,121,121, %T A290934 49,49,81,81,36,36,81,81,81,144,49,121,49,81,81,121,121,121,81,121,81, %U A290934 81,144,144,121,121,4,36,36,100,25,25,36,100,36,100,25,49,36,36 %N A290934 a(n) equals the sum of the squares of the digits of A254958(n). %H A290934 Jonathan Schwartz, <a href="/A290934/b290934.txt">Table of n, a(n) for n = 1..1000</a> %t A290934 Select[Map[Total, Select[Array[IntegerDigits, 1550], FreeQ[#, 0] &]^2], IntegerQ@ Sqrt@ # &] (* _Michael De Vlieger_, Aug 15 2017 *) %o A290934 (Java) import java.util.ArrayList;public class Seq {public static void main(String[] args) {int l = 1000; %o A290934 ArrayList<int> squares = new ArrayList<int>(); %o A290934 for (int i = 1; i <= l; i++) {squares.add((i * i));} %o A290934 int term = 1; %o A290934 for (int n = 1; n < Integer.MAX_VALUE; n++) { %o A290934 if (!(Integer.toString(n).contains("0"))) %o A290934 if (squares.contains(sum(n))){ %o A290934 int k = 0; %o A290934 for(int i = 0;i<Integer.toString(n).length();i++){k +=(Integer.valueOf(Character.toString(Integer.toString(n).charAt(i)))*Integer.valueOf(Character.toString(Integer.toString(n).charAt(i))));}System.out.print(k + ", ");term++;}if(term>1000)break;}} %o A290934 static int sum(int n) {int s = 0;String str = Integer.toString(n);for (int i = 0; i < str.length(); i++) {s += (Integer.valueOf(Character.toString(str.charAt(i)))*Integer.valueOf(Character.toString(str.charAt(i))));}return s;}} %o A290934 (PARI) lista(nn) = {for (n=1, nn, d = digits(n); if (vecmin(d) && issquare(s=sum(k=1, #d, d[k]^2)), print1(s, ", ")););} \\ _Michel Marcus_, Aug 28 2017 %Y A290934 Cf. A000290, A003132, A254958. %K A290934 nonn,base %O A290934 1,2 %A A290934 _Jonathan Schwartz_, Aug 14 2017