cp's OEIS Frontend

A385038 Consecutive internal states of the linear congruential pseudo-random number generator (1366*s + 1283) mod 6075 when started at 1.

%I A385038 #12 Jun 16 2025 17:12:06
%S A385038 1,2649,5192,4030,2313,1841,1039,5082,5645,3178,4881,4454,4372,1710,
%T A385038 4343,4621,1644,5312,3925,4683,1286,2284,4752,4415,5773,1851,2549,
%U A385038 2242,2055,1763,3841,5364,2057,4495,5703,3431,4204,3072,5885,2968,3546,3344,787,1050
%N A385038 Consecutive internal states of the linear congruential pseudo-random number generator (1366*s + 1283) mod 6075 when started at 1.
%C A385038 Periodic with period 6075.
%C A385038 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385038 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 A385038 Sean A. Irvine, <a href="/A385038/b385038.txt">Table of n, a(n) for n = 1..6075</a>
%H A385038 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 A385038 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%F A385038 a(n) = (1366*a(n-1) + 1283) mod 6075.
%p A385038 a:= proc(n) option remember; `if`(n<2, n,
%p A385038       irem(1366*a(n-1)+1283, 6075))
%p A385038     end:
%p A385038 seq(a(n), n=1..45);  # after _Alois P. Heinz_
%t A385038 NestList[Mod[1366*# + 1283, 6075] &, 1, 50] (* _Paolo Xausa_, Jun 16 2025 *)
%Y A385038 Cf. A384113, A384114, A384126, A384152, A384158, A384196, A384971, A385037.
%K A385038 nonn,look,easy
%O A385038 1,2
%A A385038 _Sean A. Irvine_, Jun 13 2025