cp's OEIS Frontend

A384431 Consecutive states of the linear congruential pseudo-random number generator (430*s + 2531) mod 11979 when started at s=1.

%I A384431 #28 Jun 17 2025 10:42:23
%S A384431 1,2961,5987,1456,5703,11105,10039,6861,5927,11593,4257,254,3940,7692,
%T A384431 3887,8860,3009,2669,217,9,6401,11770,8493,926,5404,2325,8024,2899,
%U A384431 3285,1559,2077,9195,3311,760,5898,11102,8749,3195,10775,11887,10887,152,7996,2838
%N A384431 Consecutive states of the linear congruential pseudo-random number generator (430*s + 2531) mod 11979 when started at s=1.
%C A384431 Periodic with period 11979.
%C A384431 Described in Numerical Recipes as a "quick and dirty" generator.
%D A384431 William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery, Numerical Recipes in C (2nd ed), Cambridge University Press, 1999 (see p. 285).
%H A384431 Sean A. Irvine, <a href="/A384431/b384431.txt">Table of n, a(n) for n = 1..11979</a>
%H A384431 W. E. Sharp and Carter Bays, <a href="https://doi.org/10.1016/0098-3004(92)90060-5">A review of portable random number generators</a>, Computers and Geosciences, 18, 1 (1982), 79-87.
%H A384431 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A384431 <a href="/index/Rec#order_11979">Index entries for linear recurrences with constant coefficients</a>, order 11979.
%F A384431 a(n) = (430 * a(n-1) + 2531) mod 11979.
%p A384431 a:= proc(n) option remember; `if`(n<2, n,
%p A384431       irem(430*a(n-1)+2531, 11979))
%p A384431     end:
%p A384431 seq(a(n), n=1..44);  # _Alois P. Heinz_, Jun 14 2025
%t A384431 NestList[Mod[430*# + 2531, 11979] &, 1, 50] (* _Paolo Xausa_, Jun 17 2025 *)
%Y A384431 Cf. A384971, A385002, A385003.
%K A384431 nonn,look,easy
%O A384431 1,2
%A A384431 _Sean A. Irvine_, Jun 14 2025