cp's OEIS Frontend

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.

A058852 Palindromes n such that n and n^2 have same digit sum.

This page as a plain text file.
%I A058852 #12 Sep 26 2021 19:24:51
%S A058852 0,1,9,55,99,585,595,838,999,5995,8668,9999,45954,48384,55755,56665,
%T A058852 59895,59995,64846,65656,77977,86968,88488,89398,97479,97579,99099,
%U A058852 99199,99999,158851,176671,509905,549945,558855,594495,599995,779977
%N A058852 Palindromes n such that n and n^2 have same digit sum.
%H A058852 R. J. Mathar, <a href="/A058852/b058852.txt">Table of n, a(n) for n = 1..399</a>
%p A058852 read("transforms") :
%p A058852 n := 1;
%p A058852 for i from 1 do
%p A058852     p := A002113(i) ;
%p A058852     if digsum(p) = digsum(p^2) then
%p A058852         printf("%d %d\n",n,p) ;
%p A058852         n := n+1 ;
%p A058852     end if;
%p A058852 end do: # _R. J. Mathar_, Sep 09 2015
%t A058852 Select[Range[0,78*10^4],PalindromeQ[#]&&Total[IntegerDigits[#]] == Total[ IntegerDigits[ #^2]]&] (* _Harvey P. Dale_, Sep 26 2021 *)
%Y A058852 Cf. A058369, A058370, A007953.
%K A058852 nonn,base,easy
%O A058852 1,3
%A A058852 _Patrick De Geest_, Dec 15 2000