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

47594118, 94664704, 77288171, 77627916, 85442051, 65167154, 98844528, 73424122, 88754790, 41360150, 51283441, 79519132, 28940018, 65620408, 9269369, 13195485, 3496152, 80411496, 49464390, 37680959, 66662049, 33227112, 64223569

Offset

0,1

Comments

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.

Links

Alois P. Heinz, Table of n, a(n) for n = 0..10000

Formula

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

Maple

a:= proc(n) option remember; `if`(n=0, 47594118,
      irem(23 *a(n-1), 100000001))
    end:
seq(a(n), n=0..30);  # Alois P. Heinz, Jun 10 2014

Crossrefs

Sequence in context: A237897 A230756 A022238 * A300568 A210334 A022259

Adjacent sequences: A121488 A121489 A121490 * A121492 A121493 A121494

Keyword

nonn

Author

Clark Kimberling, Aug 02 2006

Status

approved