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.

A174839 Lists of 4 adjacent primes such that the difference between the highest minus the lowest = 8.

Original entry on oeis.org

3, 5, 7, 11, 5, 7, 11, 13, 11, 13, 17, 19, 101, 103, 107, 109, 191, 193, 197, 199, 821, 823, 827, 829, 1481, 1483, 1487, 1489, 1871, 1873, 1877, 1879, 2081, 2083, 2087, 2089, 3251, 3253, 3257, 3259
Offset: 1

Views

Author

Robert Hutchins, Mar 30 2010

Keywords

Programs

  • C
    if (primes[i+3] - primes[i] == 8) { printf("%u, %u, %u, %u, \n", primes[i] , primes[i+1], primes[i+2] , primes[i+3]); }
  • Mathematica
    Flatten[Select[Partition[Prime[Range[500]],4,1],Last[#]-First[#]==8&]] (* Harvey P. Dale, Oct 01 2013 *)

Formula

a(n) >> n log^4 n. - Charles R Greathouse IV, Dec 13 2024