login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1

%I #47 Aug 24 2015 12:07:04

%S 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 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 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 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 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 row(n) = floor(n mod (10^(floor(log_10(n)) + 1 - x))), for n>=1 and x=0..floor(log_10(n)).

%e 1298 results in {1298, 298, 98, 8}.

%e Table begins:

%e 1;

%e 2;

%e 3;

%e 4;

%e 5;

%e 6;

%e 7;

%e 8;

%e 9;

%e 10, 0;

%e 11, 1;

%e 12, 2;

%e ...

%e 100, 0, 0;

%e 101, 1, 1;

%e ...

%t Table[Floor[Mod[n, (10^(Floor[Log[10, n] + 1] - x))]], {n, 1, 30}, {x, 0, Floor[Log[10, n]]}]

%t 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 Cf. A259433.

%K nonn,base,tabf

%O 1,2

%A _José de Jesús Camacho Medina_, Jun 26 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:15 EDT 2024. Contains 371265 sequences. (Running on oeis4.)