cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A385341 Consecutive states of the linear congruential pseudo-random number generator (1021*s + 25673) mod 121500 when started at s=1.

This page as a plain text file.
%I A385341 #9 Jul 06 2025 18:20:47
%S A385341 1,26694,64247,11860,106233,111566,89059,72912,110825,61498,121131,
%T A385341 13424,2077,80790,13763,105196,24789,63242,79255,26028,113261,118654,
%U A385341 35907,115220,53293,5826,20519,77572,8685,23558,21391,117384,75737,79150,40323,6956,80749
%N A385341 Consecutive states of the linear congruential pseudo-random number generator (1021*s + 25673) mod 121500 when started at s=1.
%C A385341 Periodic with period 121500.
%C A385341 Described in Numerical Recipes as a "quick and dirty" generator.
%H A385341 Sean A. Irvine, <a href="/A385341/b385341.txt">Table of n, a(n) for n = 1..10000</a>
%H A385341 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385341 <a href="/index/Rec#order_121500">Index entries for linear recurrences with constant coefficients</a>, order 121500.
%F A385341 a(n) = (1021 * a(n-1) + 25673) mod 121500.
%p A385341 a:= proc(n) option remember; `if`(n<2, n,
%p A385341       irem(1021*a(n-1)+25673, 121500))
%p A385341     end:
%p A385341 seq(a(n), n=1..44);  # after _Alois P. Heinz_
%t A385341 NestList[Mod[1021*# + 25673, 121500] &, 1, 50] (* after _Paolo Xausa_ *)
%Y A385341 Cf. A383126, A385340.
%K A385341 nonn,easy
%O A385341 1,2
%A A385341 _Sean A. Irvine_, Jun 25 2025