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 A029943 #34 Feb 16 2025 08:32:35
%S A029943 0,1,5,6,10,25,50,60,76,100,250,376,500,600,625,760,1000,2500,3760,
%T A029943 5000,6000,6250,7600,9376,10000,25000,37600,50000,60000,62500,76000,
%U A029943 90625,93760,100000,109376,250000,376000,500000,600000,625000
%N A029943 Substring of both its square and its cube.
%C A029943 Intersection of A018834 and A029942. - _Reinhard Zumkeller_, Feb 29 2012
%H A029943 Reinhard Zumkeller, <a href="/A029943/b029943.txt">Table of n, a(n) for n = 1..100</a>
%H A029943 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AutomorphicNumber.html">Automorphic Number</a>
%H A029943 Wikipedia, <a href="http://en.wikipedia.org/wiki/Automorphic_number">Automorphic number</a>
%H A029943 <a href="/index/Ar#automorphic">Index entries for sequences related to automorphic numbers</a>
%F A029943 a(n) = A003226(m) * 10^k for appropriate m and k. [_Reinhard Zumkeller_, Nov 26 2011]
%t A029943 ssscQ[n_]:=Module[{idn=IntegerDigits[n],sq=IntegerDigits[n^2], cu=IntegerDigits[n^3],len=IntegerLength[n]},MemberQ[Partition[ sq,len,1], idn] &&MemberQ[Partition[cu,len,1],idn]]; Join[{0}, Select[Range[700000],ssscQ]] (* _Harvey P. Dale_, Apr 24 2011 *)
%o A029943 (Haskell)
%o A029943 import Data.List (isInfixOf)
%o A029943 a029943 n = a029943_list !! (n-1)
%o A029943 a029943_list = filter f [0..] where
%o A029943 f x = show x `isInfixOf` show (x^2) && show x `isInfixOf` show (x^3)
%o A029943 -- _Reinhard Zumkeller_, Nov 26 2011
%K A029943 nonn,base,nice
%O A029943 1,3
%A A029943 _Patrick De Geest_
%E A029943 Offset corrected by _Reinhard Zumkeller_, Nov 26 2011