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

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,1

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.

Links

Table of n, a(n) for n=0..35.

Index entries for sequences related to pseudo-random numbers.

Formula

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

Prog

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

Crossrefs

Cf. A084276, A084277, A061364 (for other versions).

Cf. A382684 (b(n)).

Sequence in context: A393794 A329196 A083513 * A307873 A259138 A082710

Adjacent sequences: A084274 A084275 A084276 * A084278 A084279 A084280

Keyword

nonn,easy

Author

Frank Ellermann, May 25 2003

Status

approved