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 A383129 #20 Jun 18 2025 12:20:18 %S A383129 1,55194,222647,217960,59133,66566,85459,4212,13625,88498,246831, %T A383129 31424,65077,236190,217163,241996,69489,20042,198055,232728,55661, %U A383129 160054,45507,32420,225193,253026,47519,101872,174885,68558,146491,37884,192737,67450,198423 %N A383129 Consecutive internal states of the linear congruential pseudo-random number generator (421*s + 54773) mod 259200 when started at 1. %C A383129 Periodic with period 259200. %H A383129 Sean A. Irvine, <a href="/A383129/b383129.txt">Table of n, a(n) for n = 1..10000</a> %H A383129 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 A383129 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %H A383129 <a href="/index/Rec#order_259200">Index entries for linear recurrences with constant coefficients</a>, order 259200. %F A383129 a(n) = (421*a(n-1) + 54773) mod 259200. %p A383129 a:= proc(n) option remember; `if`(n<2, n, %p A383129 irem(421*a(n-1)+54773, 259200)) %p A383129 end: %p A383129 seq(a(n), n=1..45); # after _Alois P. Heinz_ %t A383129 NestList[Mod[421*# + 54773, 259200] &, 1, 50] (* _Paolo Xausa_, Jun 18 2025 *) %Y A383129 Cf. A383126, A383127, A383128. %K A383129 nonn,look,easy %O A383129 1,2 %A A383129 _Sean A. Irvine_, Jun 17 2025