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 A136845 #19 May 22 2025 10:21:35
%S A136845 0,1,10,100,1000,10000,58151,100000,550501,581510,1000000,5505010,
%T A136845 5815100,5818151,10000000,55050100,55055001,58151000,58181510,
%U A136845 100000000,183031501,550501000,550550010,555005001,581510000,581815100,1000000000,1000550501,1005055001,1830315010,3180155001,3318358151,5505010000,5505500100,5505550001
%N A136845 Numbers k such that k and k^2 use only the digits 0, 1, 3, 5 and 8.
%C A136845 Generated with DrScheme.
%H A136845 Jonathan Wellons and Chai Wah Wu, <a href="/A136845/b136845.txt">Table of n, a(n) for n = 1..237</a> (first 174 terms from Jonathan Wellons).
%H A136845 J. Wellons, <a href="https://web.archive.org/web/20090206165028/http://jonathanwellons.com/shared-digits/">Tables of Shared Digits</a> [archived]
%e A136845 58151^2 = 3381538801.
%e A136845 581858058583151^2 = 338558800338153581101581088801.
%o A136845 (Python)
%o A136845 from itertools import product
%o A136845 A136845_list = [0,1]
%o A136845 for l in range(15):
%o A136845 for a in ('1','3','5','8'):
%o A136845 for b in product('01358',repeat=l):
%o A136845 for c in ('0','1','5'):
%o A136845 n = int(''.join([a]+list(b)+[c]))
%o A136845 if set(str(n*n)) <= {'0','1','3','5','8'}:
%o A136845 A136845_list.append(n) # _Chai Wah Wu_, May 25 2015
%K A136845 base,nonn
%O A136845 1,3
%A A136845 Jonathan Wellons (wellons(AT)gmail.com), Jan 22 2008