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 A383162 #18 Jun 18 2025 12:20:36 %S A383162 1,7201,76616,68590,208477,247118,20523,9553,220556,185367,80672, %T A383162 168326,235671,155218,164488,26489,149080,185766,155062,160652,111548, %U A383162 1931,190992,3727,249506,143822,106701,83656,105369,7850,271960,64524,36741,85456,192683 %N A383162 Consecutive states of the linear congruential pseudo-random number generator (7200*s + 1) mod 23^4 when started at s=1. %C A383162 Periodic with period 23^4. %H A383162 Sean A. Irvine, <a href="/A383162/b383162.txt">Table of n, a(n) for n = 1..10000</a> %H A383162 J. Eichenauer-Herrmann and H. Grothe, <a href="https://doi.org/10.1016/0377-0427(90)90337-Y">Upper bounds for the Beyer ratios of linear congruential generators</a>, J Comp. Appl. Math., 31 1 (1990), 73-80. %H A383162 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 A383162 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %F A383162 a(n) = (7200*a(n-1) + 1) mod 23^4. %p A383162 a:= proc(n) option remember; `if`(n<2, n, %p A383162 irem(7200*a(n-1)+1, 279841)) %p A383162 end: %p A383162 seq(a(n), n=1..45); # after _Alois P. Heinz_ %t A383162 NestList[Mod[7200*# + 1, 23^4] &, 1, 50] (* _Paolo Xausa_, Jun 18 2025 *) %Y A383162 Cf. A383129, A384081. %K A383162 nonn,easy %O A383162 1,2 %A A383162 _Sean A. Irvine_, Jun 13 2025