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.

Showing 1-1 of 1 results.

A084277 Pseudo-random numbers: Davenport's generator for 32-bit integers.

Original entry on oeis.org

10904, 21520, 20895, 25213, 7963, 32668, 25961, 6826, 13530, 17404, 5948, 5449, 8262, 14606, 10788, 30720, 31758, 4871, 32173, 13874, 11466, 27821, 31595, 8091, 15213, 16731, 31046, 17581, 21096, 21170, 7302, 19629, 18847, 30239, 2465, 6541
Offset: 0

Views

Author

Frank Ellermann, May 25 2003

Keywords

Comments

Davenport recommends b(n) as generator, a(n) uses bits 16..30 of b(n).

References

  • H. Davenport, The Higher Arithmetic, 7th ed. 1999, Cambridge University Press, ch. 8.3.

Crossrefs

Cf. A084276, A084277, A061364 (for other versions).
Cf. A382684 (b(n)).

Programs

  • C
    #include 
    unsigned next= 1; int i= 0;
    int main() { while (i++ < 36) next = next * 2147001325 + 715136305, printf( "%d ", (next/65536) % 32768 ); }

Formula

b(n) = b(n-1) * 2147001325 + 715136305, b(0) = 1, a(n) = (( b(n)/(2^16) ) mod (2^15)).
Showing 1-1 of 1 results.