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 A325113 #26 Apr 14 2020 19:58:32 %S A325113 1,2,3,5,6,7,9,10,11,13,15,17,19,21,22,23,25,26,27,29,30,31,33,35,37, %T A325113 39,50,51,53,55,57,59,61,62,63,65,66,67,69,70,71,73,75,77,79,90,91,93, %U A325113 95,97,99,101,103,105,107,109,110,111,113,115,117 %N A325113 Positive integers whose decimal representation has no nonzero subsequence that is divisible by 4. %C A325113 From _Robert Israel_, Apr 14 2020: (Start) %C A325113 There are no digits 4 or 8. %C A325113 If there is a digit 2 or 6, all previous digits must be even. %C A325113 If there is a digit 0, all previous digits must be odd. (End) %H A325113 Robert Israel, <a href="/A325113/b325113.txt">Table of n, a(n) for n = 1..10000</a> %p A325113 filter:= proc(n) local L,i; %p A325113 L:= convert(n,base,10); %p A325113 if member(4,L) or member(8,L) then return false fi; %p A325113 if member(0,L,i) and hastype(L[i+1..-1],even) then return false fi; %p A325113 i:= ListTools:-SelectFirst(t -> t=2 or t=6, L,output=indices); %p A325113 i = NULL or not hastype(L[i+1..-1],odd); %p A325113 end proc: %p A325113 select(filter, [$1..300]); # _Robert Israel_, Apr 14 2020 %t A325113 With[{k = 4}, Select[Range@ 120, NoneTrue[DeleteCases[FromDigits /@ Rest@ Subsequences[IntegerDigits@ #], 0], Mod[#, k] == 0 &] &]] (* _Michael De Vlieger_, Mar 31 2019 *) %Y A325113 Cf. A014261 (for 2), A325112 (for 3), A261189 (for 5). %K A325113 nonn,base %O A325113 1,2 %A A325113 _Jonathan Kal-El Peréz_, Mar 27 2019 %E A325113 Corrected by _Robert Israel_, Apr 14 2020