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 A257835 #19 Jun 16 2015 19:19:17 %S A257835 28,2,2,5,6,9,24,9,9,57,9,6,6,3,5,2,6,27,6,3,0,99,7,35,6,0,0,59,30,28, %T A257835 4,6,33,75,25,4,0,40,7,6,8,4,5,4,7,5,5,70,0,4,75,49,2,3,9,7,3,4,15,6, %U A257835 25,9,44,5,0,4,6,6,9,3,2,99,35,2,33,5,69,8,62,30,8 %N A257835 Whole number sieve of e. %C A257835 Find the first occurrence of 0 (the first whole number) in the digits of e (only 35 digits in this illustration): %C A257835 27182818284590452353602874713526625..., and replace it with a space: %C A257835 2718281828459 452353602874713526625... Repeat the process with the next whole number, 1: %C A257835 27 8281828459 452353602874713526625... Then 2: %C A257835 7 8281828459 452353602874713526625... Then 3: %C A257835 7 8281828459 452 53602874713526625... Then 4,5,6,7, etc., until the first occurrence of every counting number is eliminated from the digits of e. %C A257835 28 2 02 5 6 ... Then consolidate gaps between the remaining digits into a single comma: %C A257835 28,2,2,5,6,9,24,9,9,57,9,6,6,3,5,2,... to produce the first terms in the whole number sieve of e. %H A257835 Manfred Scheucher, <a href="/A257835/b257835.txt">Table of n, a(n) for n = 1..536</a> %H A257835 Manfred Scheucher, <a href="/A257835/a257835.sage.txt">Sage Script</a> %Y A257835 Cf. A001113, A247747, A248804, A258640, A258481. %K A257835 nonn,base,easy %O A257835 1,1 %A A257835 _Manfred Scheucher_, Jun 05 2015