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 A259434 #47 Aug 24 2015 12:07:04 %S A259434 1,2,3,4,5,6,7,8,9,10,0,11,1,12,2,13,3,14,4,15,5,16,6,17,7,18,8,19,9, %T A259434 20,0,21,1,22,2,23,3,24,4,25,5,26,6,27,7,28,8,29,9,30,0,31,1,32,2,33, %U A259434 3,34,4,35,5,36,6,37,7,38,8,39,9,40,0,41,1,42,2,43,3,44,4,45,5,46,6,47,7,48,8,49,9,50,0 %N A259434 Irregular table read by rows: suppose n has d decimal digits; then T(n,j) for 1 <= j <= d is the number obtained by discarding the d-j most significant digits of n. %H A259434 Matematico Fresnillense, <a href="http://matematicofresnillense.blogspot.mx/2015/06/formulas-para-extraer-digitos-de-un.html">Formulas para extraer digitos de un numero natural permutando</a> %F A259434 row(n) = floor(n mod (10^(floor(log_10(n)) + 1 - x))), for n>=1 and x=0..floor(log_10(n)). %e A259434 1298 results in {1298, 298, 98, 8}. %e A259434 Table begins: %e A259434 1; %e A259434 2; %e A259434 3; %e A259434 4; %e A259434 5; %e A259434 6; %e A259434 7; %e A259434 8; %e A259434 9; %e A259434 10, 0; %e A259434 11, 1; %e A259434 12, 2; %e A259434 ... %e A259434 100, 0, 0; %e A259434 101, 1, 1; %e A259434 ... %t A259434 Table[Floor[Mod[n, (10^(Floor[Log[10, n] + 1] - x))]], {n, 1, 30}, {x, 0, Floor[Log[10, n]]}] %t A259434 f[n_, x_] := Floor[ Mod[ n, (10^(Floor[ Log[10, n] + 1] - x))]]; Table[ f[n, x], {n, 50}, {x, 0, Floor[ Log[10, n]]}] // Flatten (* _Robert G. Wilson v_, Jul 28 2015 *) %Y A259434 Cf. A259433. %K A259434 nonn,base,tabf %O A259434 1,2 %A A259434 _José de Jesús Camacho Medina_, Jun 26 2015