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 A046031 #40 Feb 16 2025 08:32:38
%S A046031 0,1,8,10,11,18,80,81,88,100,101,108,110,111,118,180,181,188,800,801,
%T A046031 808,810,811,818,880,881,888,1000,1001,1008,1010,1011,1018,1080,1081,
%U A046031 1088,1100,1101,1108,1110,1111,1118,1180,1181,1188,1800,1801,1808
%N A046031 Digits are cubes.
%C A046031 This is also a sequence where the digits of each integer are both horizontally and vertically symmetrical. - _Philip Mizzi_, May 24 2014
%C A046031 Numbers with no prime or semiprime digits. - _Wesley Ivan Hurt_, Jan 17 2016
%C A046031 Because the digits of each term can only be 0, 1 or 8, each number in the sequence is both mirror ambigrammatic and rotationally ambigrammatic. - _Philip Mizzi_, Jan 01 2021
%H A046031 Bruno Berselli, <a href="/A046031/b046031.txt">Table of n, a(n) for n = 0..1000</a>
%H A046031 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SmarandacheSequences.html">Smarandache Sequences</a>.
%F A046031 G.f. G(x) satisfies G(x) = 10*(1+x+x^2)*G(x^3)+x*(1+8*x)/(1-x^3). - _Robert Israel_, Jan 18 2016
%p A046031 M[1]:= [0,1,8]:
%p A046031 for n from 2 to 4 do M[n]:= map(t -> (10*t,10*t+1, 10*t+8), M[n-1]) od:
%p A046031 M[4]; # _Robert Israel_, Jan 18 2016
%o A046031 (Magma) [n: n in [0..2000] | forall{d: d in Intseq(n) | d in [0,1,8]}]; // _Bruno Berselli_, Jan 10 2013
%K A046031 nonn,base
%O A046031 0,3
%A A046031 _Eric W. Weisstein_