A121491 - OEIS

%I #5 Jun 10 2014 05:22:12

%S 47594118,94664704,77288171,77627916,85442051,65167154,98844528,

%T 73424122,88754790,41360150,51283441,79519132,28940018,65620408,

%U 9269369,13195485,3496152,80411496,49464390,37680959,66662049,33227112,64223569

%N An historic sequence: Lehmer's linear congruential pseudorandom numbers.

%C The linear congruential generator for pseudorandom numbers was proposed by Derrick Henry Lehmer: "Mathematical methods in large-scale computing units," in Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery, Cambridge, MA, 1949, pp. 141-146, Cambridge, MA, 1951, Harvard University Press. The method is often noted as the earliest published method for generating pseudorandom numbers. It is still in use today.

%H Alois P. Heinz, <a href="/A121491/b121491.txt">Table of n, a(n) for n = 0..10000</a>

%F Recurrence: X(n+1) = (a*X(n) + c) mod m, Initial Value: X(0)=47594118 Parameters: a=23, c=0, m=100000001

%p a:= proc(n) option remember; `if`(n=0, 47594118,

%p       irem(23 *a(n-1), 100000001))

%p     end:

%p seq(a(n), n=0..30);  # _Alois P. Heinz_, Jun 10 2014

%K nonn

%O 0,1

%A _Clark Kimberling_, Aug 02 2006