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.

A385361 Consecutive states of the linear congruential pseudo-random number generator (2661*s + 36979) mod 175000 when started at s=1.

This page as a plain text file.
%I A385361 #10 Jul 06 2025 18:16:33
%S A385361 1,39640,169019,46538,149597,164596,1935,111014,45233,1992,87691,
%T A385361 107730,56509,82428,102887,119286,7025,5504,158123,102282,84381,49820,
%U A385361 132999,97318,177,157976,61115,88994,75013,146572,165071,40910,48489,91208,16467,105666
%N A385361 Consecutive states of the linear congruential pseudo-random number generator (2661*s + 36979) mod 175000 when started at s=1.
%C A385361 Periodic with period 175000.
%C A385361 Described in Numerical Recipes as a "quick and dirty" generator.
%H A385361 Sean A. Irvine, <a href="/A385361/b385361.txt">Table of n, a(n) for n = 1..10000</a>
%H A385361 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385361 <a href="/index/Rec#order_175000">Index entries for linear recurrences with constant coefficients</a>, order 175000.
%F A385361 a(n) = (2661 * a(n-1) + 36979) mod 175000.
%p A385361 a:= proc(n) option remember; `if`(n<2, n,
%p A385361       irem(2661*a(n-1)+36979, 175000))
%p A385361     end:
%p A385361 seq(a(n), n=1..44);  # after _Alois P. Heinz_
%t A385361 NestList[Mod[2661*# + 36979, 175000] &, 1, 50] (* after _Paolo Xausa_ *)
%Y A385361 Cf. A383127, A385360.
%K A385361 nonn,easy
%O A385361 1,2
%A A385361 _Sean A. Irvine_, Jun 26 2025