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.
%I A385365 #18 Jul 08 2025 14:06:56 %S A385365 1,34470,108479,13228,52917,137546,139315,54624,117473,135262,88191, %T A385365 96860,49669,56418,124307,76936,7905,102614,119863,137052,80381,81250, %U A385365 55059,106208,9697,102126,82895,99604,35253,59042,107971,48840,83249,83398,45687,58316 %N A385365 Consecutive states of the linear congruential pseudo-random number generator (3661*s + 30809) mod 145800 when started at s=1. %C A385365 Periodic with period 145800. %C A385365 Described in Numerical Recipes as a "quick and dirty" generator. %H A385365 Sean A. Irvine, <a href="/A385365/b385365.txt">Table of n, a(n) for n = 1..10000</a> %H A385365 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %H A385365 <a href="/index/Rec#order_145800">Index entries for linear recurrences with constant coefficients</a>, order 145800. %F A385365 a(n) = (3661 * a(n-1) + 30809) mod 145800. %p A385365 a:= proc(n) option remember; `if`(n<2, n, %p A385365 irem(3661*a(n-1)+30809, 145800)) %p A385365 end: %p A385365 seq(a(n), n=1..44); # after _Alois P. Heinz_ %t A385365 NestList[Mod[3661*# + 30809, 145800] &, 1, 50] (* after _Paolo Xausa_ *) %Y A385365 Cf. A383127, A385361. %K A385365 nonn,look,easy %O A385365 1,2 %A A385365 _Sean A. Irvine_, Jun 26 2025