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.

A073831 Maximum of A073830(k) for k between A001359(n) and A001359(n+1).

Original entry on oeis.org

8, 56, 182, 552, 1406, 2862, 4556, 9506, 10712, 17292, 19460, 30102, 32942, 37442, 49952, 54522, 69432, 77006, 94556, 113906, 167690, 177662, 209306, 259590, 317532, 352242, 376382, 398792, 427062, 636006, 658532, 678152
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 12 2002

Keywords

Comments

a(n) = A073830(A073832(n)); a(n) < A037074(n+2).

Programs

  • Maple
    A073831 := proc(n)
        A073830(A073832(n)) ;
    end proc:
    seq(A073831(n),n=1..50) ; # R. J. Mathar, Feb 21 2017
  • Mathematica
    f[n_] := Mod[4*((n - 1)! + 1) + n, n*(n + 2)];
    pp = Select[Prime[Range[200]], PrimeQ[# + 2] & ];
    a[n_] := Max[f /@ Range[pp[[n]], pp[[n + 1]]]];
    Array[a, Length[pp] - 1] (* Jean-François Alcover, Feb 22 2018 *)