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 A384340 #14 May 27 2025 08:39:20 %S A384340 1,525484084,688663427,968835230,345480693,594745016,131517399, %T A384340 829111042,288543145,869414908,434391531,199282214,320720157, %U A384340 893442560,869170623,49089546,741928529,919640772,742683475,166897838,983989061,87606344,997022887,710415890 %N A384340 Consecutive states of the linear congruential pseudo-random number generator (314159221*s+211324863) mod 10^9 when started at s=1. %C A384340 Periodic with period 10^9. %C A384340 A generator recommended by Van Es et al. for pocket calculators. %C A384340 Referred to as "Pocket II" in the literature. %H A384340 Sean A. Irvine, <a href="/A384340/b384340.txt">Table of n, a(n) for n = 1..10000</a> %H A384340 A.J. Van Es, R.D. Gill, and C. Van Putten, <a href="https://doi.org/10.1111/j.1467-9574.1983.tb00805.x">Random number generators for a pocket calculator</a>, Statistica Neerlandica, 37, 3 (1983), 95-102. %H A384340 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384340 a(n) = (314159221 * a(n-1) + 211324863) mod 10^9. %t A384340 NestList[Mod[314159221*# + 211324863, 10^9] &, 1, 50] (* _Paolo Xausa_, May 27 2025 *) %Y A384340 Cf. A384081, A384341. %K A384340 nonn,easy %O A384340 1,2 %A A384340 _Sean A. Irvine_, May 26 2025