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.

A048628 n-th 4k+1 prime times (n+1)st 4k+3 prime.

Original entry on oeis.org

35, 143, 323, 667, 1147, 1763, 2491, 3599, 4891, 6319, 7663, 8383, 11227, 12091, 17399, 19519, 21823, 26123, 29503, 32231, 35263, 43739, 46367, 50851, 57311, 61063, 66203, 70531, 77059, 84823, 89711, 103459
Offset: 1

Views

Author

Den Roussel (DenRoussel(AT)webtv.net)

Keywords

Crossrefs

Programs

  • Mathematica
    Module[{nn=100,p1,p3,len},p1=Select[Prime[Range[nn]],Mod[#,4]==1&];p3= Rest[Select[Prime[Range[nn]],Mod[#,4]==3&]];len=Min[Length[p1], Length[ p3]];Times@@@Thread[{Take[p1,len],Take[p3,len]}]] (* Harvey P. Dale, Jan 09 2015 *)

Formula

a(n) = A002144(n) * A002145(n+1). - Sean A. Irvine, Jun 24 2021