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 A384863 #13 Jun 12 2025 21:55:58 %S A384863 1,302875106592253,458357793578900489,130117127544889829, %T A384863 214028503895537745,129723886062288141,506561892515206873, %U A384863 27366493393768821,104092279467936161,249472354291378461,22695394996597417,331563264261234181,550296776567063537,359770781871757869 %N A384863 Consecutive states of the linear congruential pseudo-random number generator G05CAF when started at s=1. %C A384863 Periodic with period 2^57. %C A384863 This is the generator used by the G05CAF routine in the Fortran NAG library. %H A384863 Sean A. Irvine, <a href="/A384863/b384863.txt">Table of n, a(n) for n = 1..10000</a> %H A384863 NAG, <a href="http://www1.udel.edu/nag/ohufl18pd/f77/Manual/G05/g05_intro_fl19.pdf">G05CAF</a>, NAG Fortran Library Routine Document. %H A384863 B. D. Ripley, <a href="https://doi.org/10.2307/1402590">Computer Generation of Random Variables: A Tutorial</a>, International Statistical Review, 51 (1983), 301-309. %H A384863 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384863 a(n) = 13^13 * a(n-1) mod 2^59. %t A384863 NestList[Mod[13^13*#, 2^59] &, 1, 20] (* _Paolo Xausa_, Jun 11 2025 *) %Y A384863 Cf. A384217, A384387 (other Fortran pseudo-random number generators). %K A384863 nonn,easy %O A384863 1,2 %A A384863 _Sean A. Irvine_, Jun 10 2025