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.

A053918 Numbers k such that k^2 contains only digits {2,3,5}.

This page as a plain text file.
%I A053918 #25 Feb 29 2024 09:16:50
%S A053918 5,15,235,485,1885,5765,15885,50235,57665,72335,1798765,15249765,
%T A053918 187703365,179876492415,159789024443333515,576387476638096486959455635
%N A053918 Numbers k such that k^2 contains only digits {2,3,5}.
%H A053918 Michael S. Branicky, <a href="/A053918/a053918.txt">Python program</a>
%H A053918 Patrick De Geest, <a href="http://www.worldofnumbers.com/threedigits.htm">Squares containing at most three distinct digits, Index entries for related sequences</a>
%H A053918 Author?, <a href="http://web.archive.org/web/20080708203024/http://blue.kakiko.com/mmrmmr/htm/eqtn06.html">Source</a>(<a href="http://web.archive.org/web/20060426155831/http://blue.kakiko.com/mmrmmr/txt/eqtn06.txt">txt</a>)
%H A053918 H. Mishima <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/math02/math0210.htm#235">Squares consisted of 3 different digits</a>
%o A053918 (Python) # see link for faster version
%o A053918 def aupto(limit):
%o A053918   alst = []
%o A053918   for k in range(1, limit+1):
%o A053918     if set(str(k*k)) <= set("235"): alst.append(k)
%o A053918   return alst
%o A053918 print(aupto(2*10**6)) # _Michael S. Branicky_, May 15 2021
%Y A053918 Cf. A053919.
%K A053918 nonn,base,more
%O A053918 1,1
%A A053918 _Patrick De Geest_, Mar 15 2000
%E A053918 More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 03 2005
%E A053918 One more term from Mishima's webpage added by _Max Alekseyev_, Jun 17 2011
%E A053918 a(16) from _Zhao Hui Du_, Feb 29 2024