%I #11 Jun 13 2025 08:20:20
%S 1,513,263169,135005697,538445857,1344817825,549293538,467227237,
%T 1316887764,1253557774,977527609,1107973666,1454807850,1139601541,
%U 500038549,969221644,1141980915,1720657411,81472926,993421745,671730846,1000540478,28673581,1824645171
%N Consecutive states of the linear congruential pseudo-random number generator 513*s mod (2^31-1) when started at s=1.
%C Periodic with period 2^31-2.
%H Sean A. Irvine, <a href="/A384935/b384935.txt">Table of n, a(n) for n = 1..10000</a>
%H B. D. Ripley, <a href="https://doi.org/10.2307/1402590">Computer Generation of Random Variables: A Tutorial</a>, International Statistical Review, 51 (1983), 301-309.
%H Alan Tootill, <a href="https://archive.org/details/PersonalComputerWorld1982-09/page/172/mode/2up">PCW Subset</a>, Personal Computer World, September 1982, see p. 173.
%H <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%F a(n) = 513 * a(n-1) mod (2^31-1).
%t NestList[Mod[513*#, 2^31 - 1] &, 1, 30] (* _Paolo Xausa_, Jun 13 2025 *)
%Y Cf. A096550.
%K nonn,easy
%O 1,2
%A _Sean A. Irvine_, Jun 12 2025