A384429 Consecutive states of the linear congruential pseudo-random number generator for Prime Sheffield Pascal when started at 1.

1, 16807, 282475249, 1622647863, 947787489, 1578110407, 1878557649, 613813847, 2005365185, 1564292583, 1570623665, 602936439, 1724879009, 1159739911, 1187094929, 1381381783, 437908353, 499227175, 292517489, 751367351, 1027218017, 832165447, 1791151953

Offset: 1

Author

Sean A. Irvine, May 28 2025

Keywords

• nonn
• easy

Comments

Periodic with period 2^28 (considerably less than the modulus).

A weak version of A096550.

References

• J. R. Gilbert, The University of Sheffield Pascal System for Prime Computers, University of Sheffield, 1987 (see p. 10).

Links

• Sean A. Irvine, Table of n, a(n) for n = 1..10000
• Stephen K. Park and Keith W. Miller, Random number generators: good ones are hard to find, Communications of the ACM, Vol 31, 10 (1988), 192-201.
• B. D. Ripley, Computer Generation of Random Variables: A Tutorial, International Statistical Review, 51 (1983), 301-309.
• Index entries for sequences related to pseudo-random numbers.

Crossrefs

Cf. A096550.

Programs

Mathematica

NestList[Mod[16807*#, 2^31] &, 1, 50] (* Paolo Xausa, May 30 2025 *)

Formula

a(n) = 16807 * a(n-1) mod 2^31.