|
Search: id:A084277
|
|
|
| A084277 |
|
Pseudo-random numbers: Davenport's generator for 32 bits integers. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
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.
|
|
FORMULA
|
b(n) = b(n-1) * 2147001325 +715136305, b(0) = 1, a(n) = (( b(n)/(2^16) ) mod (2^15)).
|
|
PROGRAM
|
/* C */ unsigned next= 1; int i= 0; while (i++ < 36) next = next * 2147001325 +715136305, printf( "%d ", (next/65536) % 32768 );
|
|
CROSSREFS
|
See A084276, A084277, A061364 for other versions.
Adjacent sequences: A084274 A084275 A084276 this_sequence A084278 A084279 A084280
Sequence in context: A123078 A065321 A083513 this_sequence A082710 A065322 A089381
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Frank.Ellermann(AT)t-online.de, May 25 2003
|
|
|
Search completed in 0.002 seconds
|
