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 A225297 #14 Aug 08 2023 03:21:57
%S A225297 1,11,21,31,32,41,51,61,64,71,72,81,91,101,111,112,121,125,131,141,
%T A225297 151,152,161,171,181,191,192,201,211,216,221,231,232,241,243,251,261,
%U A225297 271,272,281,291,301,311,312,321,331,341,351,352,361,371,375,381,384,391
%N A225297 Numbers divisible by their last digit cubed.
%C A225297 Numbers k such that (k mod 10)^3 | k.
%C A225297 All numbers ending in 1 are trivially included in this sequence.
%C A225297 The sequence is { 1+10k, 32 + 40k, 243 + 270k, 64 + 320k, 125 + 250k, 216 + 1080k, 3087 + 3430k, 2048 + 2560k, 729 + 7290k ; k = 0,1,2,...}. - _M. F. Hasler_, Jan 31 2016
%C A225297 The asymptotic density of this sequence is 2201597407/16003008000 = 0.137573... . - _Amiram Eldar_, Aug 08 2023
%H A225297 Christian N. K. Anderson, <a href="/A225297/b225297.txt">Table of n, a(n) for n = 1..10000</a>
%e A225297 a(16) = 112 is divisible by 2^3.
%t A225297 Select[Range[400], (m = Mod[#, 10]) > 0 && Divisible[#, m^3] &] (* _Amiram Eldar_, Aug 08 2023 *)
%o A225297 (R) x=0; y=rep(0,100); len=0; isint<-function(x) x==as.integer(x); while(len<100) if((x=x+1)%%10>0) if(isint(x/(x%%10)^3)) y[(len=len+1)]=x
%o A225297 (PARI) is(n)=n%10&&n%(n%10)^3==0 \\ _M. F. Hasler_, Jan 31 2016
%Y A225297 Cf. A132359, A034709, A034837, A005349, A007602, A034838.
%K A225297 nonn,base
%O A225297 1,2
%A A225297 _Kevin L. Schwartz_ and _Christian N. K. Anderson_, May 04 2013