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).

This page as a plain text file.
%I A073831 #11 Feb 22 2018 08:00:12
%S A073831 8,56,182,552,1406,2862,4556,9506,10712,17292,19460,30102,32942,37442,
%T A073831 49952,54522,69432,77006,94556,113906,167690,177662,209306,259590,
%U A073831 317532,352242,376382,398792,427062,636006,658532,678152
%N A073831 Maximum of A073830(k) for k between A001359(n) and A001359(n+1).
%C A073831 a(n) = A073830(A073832(n)); a(n) < A037074(n+2).
%p A073831 A073831 := proc(n)
%p A073831     A073830(A073832(n)) ;
%p A073831 end proc:
%p A073831 seq(A073831(n),n=1..50) ; # _R. J. Mathar_, Feb 21 2017
%t A073831 f[n_] := Mod[4*((n - 1)! + 1) + n, n*(n + 2)];
%t A073831 pp = Select[Prime[Range[200]], PrimeQ[# + 2] & ];
%t A073831 a[n_] := Max[f /@ Range[pp[[n]], pp[[n + 1]]]];
%t A073831 Array[a, Length[pp] - 1] (* _Jean-François Alcover_, Feb 22 2018 *)
%K A073831 nonn
%O A073831 1,1
%A A073831 _Reinhard Zumkeller_, Aug 12 2002