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.

A084275 Pseudo-random numbers: MS C 6.0 version.

This page as a plain text file.
%I A084275 #38 Aug 24 2025 19:50:29
%S A084275 41,18467,6334,26500,19169,15724,11478,29358,26962,24464,5705,28145,
%T A084275 23281,16827,9961,491,2995,11942,4827,5436,32391,14604,3902,153,292,
%U A084275 12382,17421,18716,19718,19895,5447,21726,14771
%N A084275 Pseudo-random numbers: MS C 6.0 version.
%H A084275 Zhuorui He, <a href="/A084275/b084275.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..98 from Alan Klette).
%H A084275 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a084/A084275.java">Java program</a> (github)
%H A084275 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>.
%F A084275 a(n) = A096558(n+199670977) = floor((A096557(n+199670977) mod 2^31)/2^16). - _Zhuorui He_, Aug 22 2025
%o A084275 (C)
%o A084275 #include <stdio.h>
%o A084275 int main()
%o A084275 {
%o A084275     long next = 1;
%o A084275     int i = 0;
%o A084275     while ( i++ < 33 )
%o A084275     {
%o A084275         next = next * 214013L + 2531011L;
%o A084275         printf( "%d ", (unsigned)( next >> 16) & 0x7FFF );
%o A084275     }
%o A084275     printf("\n");
%o A084275     return 0;
%o A084275 }
%Y A084275 Cf. A084276, A084277, A096557, A096558, A061364, A384289.
%K A084275 nonn,easy,changed
%O A084275 0,1
%A A084275 _Frank Ellermann_, May 20 2003
%E A084275 Corrected by _Alan Klette_, Jun 09 2019