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 A385463 #9 Jul 06 2025 19:23:55 %S A385463 1,61914,246647,97000,149373,119366,197779,13812,190265,10738,11631, %T A385463 167744,151477,110430,149003,69196,148209,101642,120295,92568,122861, %U A385463 13174,40707,180260,104233,219426,111839,101872,207525,144398,103291,231804,115937,76090 %N A385463 Consecutive internal states of the linear congruential pseudo-random number generator (7141*s + 54773) mod 259200 when started at 1. %C A385463 Periodic with period 259200. %C A385463 Described in Numerical Recipes as a "quick and dirty" generator. %D A385463 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 A385463 Sean A. Irvine, <a href="/A385463/b385463.txt">Table of n, a(n) for n = 1..10000</a> %H A385463 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %H A385463 <a href="/index/Rec#order_259200">Index entries for linear recurrences with constant coefficients</a>, order 259200. %F A385463 a(n) = (7141*a(n-1) + 54773) mod 259200. %p A385463 a:= proc(n) option remember; `if`(n<2, n, %p A385463 irem(7141*a(n-1)+54773, 259200)) %p A385463 end: %p A385463 seq(a(n), n=1..45); # after _Alois P. Heinz_ %t A385463 NestList[Mod[7141*# + 54773, 259200] &, 1, 50] %Y A385463 Cf. A383129, A385358, A385360. %K A385463 nonn,easy %O A385463 1,2 %A A385463 _Sean A. Irvine_, Jun 29 2025