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.

A096558 Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++.

Original entry on oeis.org

0, 38, 7719, 21238, 2437, 8855, 11797, 8365, 32285, 10450, 30612, 5853, 28100, 1142, 281, 20537, 15921, 8945, 26285, 2997, 14680, 20976, 31891, 21655, 25906, 18457, 1323, 28881, 2240, 9725, 32278, 2446, 590, 840, 18587, 16907, 21237, 23611, 12617
Offset: 1

Views

Author

Hugo Pfoertner, Jul 21 2004

Keywords

Crossrefs

Cf. A096557 corresponding internal states. A096550-A096561 other pseudo-random number generators.

Programs

  • Maple
    b:= proc(n) option remember; `if`(n<2, 0,
          irem(214013 *b(n-1) +2531011, 4294967296))
        end:
    a:= n-> irem(iquo(b(n), 65536), 32768):
    seq(a(n), n=1..50);  # Alois P. Heinz, Jun 10 2014
  • Mathematica
    A096557 = NestList[Mod[#*214013 + 2531011, 2^32] &, 0, 50];
    Mod[BitShiftRight[A096557, 16], 2^15] (* Paolo Xausa, Aug 29 2024 *)
  • PARI
    a(n)=A096557(n)>>16%2^15 \\ M. F. Hasler, May 14 2015
    
  • PARI
    A096558(n)=lift((Mod(214013, 2^34)^(n-1)-1)*13129821757)>>18%32768 \\ M. F. Hasler, May 14 2015

Formula

b(1)=0, b(n)=(b(n-1) * 214013 + 2531011) mod 2^32. a(n) = (floor(b(n)/65536) mod 32768). The sequence is periodic with period length 2^32.
a(n) = floor(A096557(n)/2^16) mod 2^15 = floor((2531011*(214013^(n-1)-1)/214012 mod 2^32)/2^16) mod 2^15. - M. F. Hasler, May 14 2015