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.

A246821 Max _{2<=k<=n} floor(A242720(k)/prime(k)) - prime(n).

This page as a plain text file.
%I A246821 #10 Sep 13 2014 14:41:48
%S A246821 1,2,4,8,6,8,6,14,14,16,10,14,12,26,26,20,18,12,26,37,31,27,50,42,38,
%T A246821 36,32,30,41,27,23,27,25,15,16,22,16,26,20,14,29,19,34,30,40,40,28,24,
%U A246821 22,18,12,10,20,20,14,8,16,10,26,41,31,17,13,11,45,31,47
%N A246821 Max _{2<=k<=n} floor(A242720(k)/prime(k)) - prime(n).
%C A246821 Conjecture: a(n) = o(prime(n)), as n goes to infinity.
%C A246821 If the conjecture is true, then A242720(n) ~ prime(n)^2. Indeed, A242720(n) >= prime(n)^2 + 2*prime(n) + 3; on the other hand, by the conjecture, we have A242720(n)/prime(n) <= a(n) + 1 + prime(n) = prime(n)*(1+o(1)).
%H A246821 Peter J. C. Moses, <a href="/A246821/b246821.txt">Table of n, a(n) for n = 2..2501</a>
%Y A246821 Cf. A242719, A242720, A246748, A246819.
%K A246821 nonn
%O A246821 2,2
%A A246821 _Vladimir Shevelev_, Sep 04 2014
%E A246821 More terms from _Peter J. C. Moses_, Sep 04 2014