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.

A022764 (n-th 8k+3 prime plus n-th 8k+5 prime)/8.

Original entry on oeis.org

1, 3, 6, 10, 14, 16, 23, 27, 35, 37, 42, 45, 51, 57, 65, 70, 75, 81, 87, 94, 101, 105, 111, 119, 126, 133, 138, 147, 153, 156, 162, 168, 171, 177, 181, 189, 198, 204, 207, 214, 220, 231, 243, 248, 255, 264, 270, 277, 284, 286, 296, 309, 314, 316
Offset: 1

Views

Author

Keywords

Programs

  • PARI
    lista(nn) = {prm = primes(nn); tp = select(p->(Mod(p,8)==3), prm); fp = select(p->(Mod(p, 8)==5), prm); for (i = 1, min(#tp, #fp), print1((tp[i] + fp[i])/8, ", "););} \\ Michel Marcus, Sep 30 2013

Formula

a(n) = (A007520(n) + A007521(n))/8 = A022763(n)/8. - Michel Marcus, Sep 30 2013