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.
%I A084277 #14 Jul 04 2025 12:36:59
%S A084277 10904,21520,20895,25213,7963,32668,25961,6826,13530,17404,5948,5449,
%T A084277 8262,14606,10788,30720,31758,4871,32173,13874,11466,27821,31595,8091,
%U A084277 15213,16731,31046,17581,21096,21170,7302,19629,18847,30239,2465,6541
%N A084277 Pseudo-random numbers: Davenport's generator for 32-bit integers.
%C A084277 Davenport recommends b(n) as generator, a(n) uses bits 16..30 of b(n).
%D A084277 H. Davenport, The Higher Arithmetic, 7th ed. 1999, Cambridge University Press, ch. 8.3.
%H A084277 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%F A084277 b(n) = b(n-1) * 2147001325 + 715136305, b(0) = 1, a(n) = (( b(n)/(2^16) ) mod (2^15)).
%o A084277 (C)
%o A084277 #include <stdio.h>
%o A084277 unsigned next= 1; int i= 0;
%o A084277 int main() { while (i++ < 36) next = next * 2147001325 + 715136305, printf( "%d ", (next/65536) % 32768 ); }
%Y A084277 Cf. A084276, A084277, A061364 (for other versions).
%Y A084277 Cf. A382684 (b(n)).
%K A084277 nonn,easy
%O A084277 0,1
%A A084277 _Frank Ellermann_, May 25 2003