cp's OEIS Frontend

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.

A384778 Consecutive states of the linear congruential pseudo-random number generator 55151000561141*s mod 2^48 when started at 1.

This page as a plain text file.
%I A384778 #14 Jun 11 2025 10:11:51
%S A384778 1,55151000561141,29815832362105,55100342394061,179741519900977,
%T A384778 7132195055845,74704892394537,220210368430141,73887840684897,
%U A384778 135379684698325,280350175386841,124994015967405,227696133324433,118996703729093,242320442691209,24065948923421
%N A384778 Consecutive states of the linear congruential pseudo-random number generator 55151000561141*s mod 2^48 when started at 1.
%C A384778 Periodic with period 2^46.
%H A384778 Sean A. Irvine, <a href="/A384778/b384778.txt">Table of n, a(n) for n = 1..10000</a>
%H A384778 George S. Fishman, <a href="https://doi.org/10.2307/2008698">Multiplicative Congruential Random Number Generators with Modulus 2^beta: An Exhaustive Analysis for beta = 32 and a Partial Analysis for beta = 48</a>, Math. Comp., 54, 189 (1990), 331-344.
%H A384778 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>.
%F A384778 a(n) = 55151000561141 * a(n-1) mod 2^48.
%p A384778 a:= proc(n) option remember; `if`(n<2, n,
%p A384778       irem(55151000561141*a(n-1), 2^48))
%p A384778     end:
%p A384778 seq(a(n), n=1..16);  # _Alois P. Heinz_, Jun 09 2025
%t A384778 NestList[Mod[55151000561141*#, 2^48] &, 1, 30] (* _Paolo Xausa_, Jun 11 2025 *)
%Y A384778 Cf. A384696, A384746, A384775, A384776, A384779, A384780.
%Y A384778 Cf. A384546, A384547, A384548, A384549, A384550, A384551, A384552.
%K A384778 nonn,easy
%O A384778 1,2
%A A384778 _Sean A. Irvine_, Jun 09 2025