A084276 -id:A084276 - cp's OEIS frontend

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

Frank Ellermann, May 25 2003

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

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

Index entries for sequences related to pseudo-random numbers.

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

Cf. A382684 (b(n)).

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

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

A385127 Consecutive internal states of the linear congruential pseudo-random number generator for gcc 2.6.3 when started at 1.

Original entry on oeis.org

1, 69074, 475904815, 884950952, 997714317, 2674863854, 2153294491, 4064640292, 103025113, 3375687626, 3068976839, 1640333408, 3540823269, 1389565030, 527860659, 3125448028, 2218581681, 3669905602, 625116511, 3161038872, 3721292605, 2231040222, 880447435

Offset: 1

Sean A. Irvine, Jun 18 2025

Periodic with period 2^32.

Sean A. Irvine, Table of n, a(n) for n = 1..10000
George S. Fishman, Multiplicative Congruential Random Number Generators with Modulus 2^beta: An Exhaustive Analysis for beta = 32 and a Partial Analysis for beta = 48, Math. Comp., 54, 189 (1990), 331-344.
Index entries for sequences related to pseudo-random numbers.

Cf. A084276, A096552.

NestList[Mod[69069*# + 5, 2^32] &, 1, 50] (* Paolo Xausa, Jun 19 2025 *)

a(n) = (69069 * a(n-1) + 5) mod 2^32.

A084275 Pseudo-random numbers: MS C 6.0 version.

Original entry on oeis.org

41, 18467, 6334, 26500, 19169, 15724, 11478, 29358, 26962, 24464, 5705, 28145, 23281, 16827, 9961, 491, 2995, 11942, 4827, 5436, 32391, 14604, 3902, 153, 292, 12382, 17421, 18716, 19718, 19895, 5447, 21726, 14771

Offset: 0

Frank Ellermann, May 20 2003

Zhuorui He, Table of n, a(n) for n = 0..10000 (terms 0..98 from Alan Klette).
Sean A. Irvine, Java program (github)
Index entries for sequences related to pseudo-random numbers.

Cf. A084276, A084277, A096557, A096558, A061364, A384289.

#include 
int main()
{
    long next = 1;
    int i = 0;
    while ( i++ < 33 )
    {
        next = next * 214013L + 2531011L;
        printf( "%d ", (unsigned)( next >> 16) & 0x7FFF );
    }
    printf("\n");
    return 0;
}

a(n) = A096558(n+199670977) = floor((A096557(n+199670977) mod 2^31)/2^16). - Zhuorui He, Aug 22 2025

Corrected by Alan Klette, Jun 09 2019

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

C

Formula

A385127 Consecutive internal states of the linear congruential pseudo-random number generator for gcc 2.6.3 when started at 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A084275 Pseudo-random numbers: MS C 6.0 version.

Views

Author

Keywords

Links

Crossrefs

Programs

C

Formula

Extensions