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.

A196674 Numbers n such that c(n) = p_{2n}, where c(n) is the n-th Chebyshev prime and p_{2n} the 2n-th prime.

This page as a plain text file.
%I A196674 #13 Aug 13 2013 03:01:28
%S A196674 510,10271,11259,11987,14730,18772,18884,21845,24083,33723,46789
%N A196674 Numbers n such that c(n) = p_{2n}, where c(n) is the n-th Chebyshev prime and p_{2n} the 2n-th prime.
%C A196674 The Chebyshev primes (of index 1) are such odd primes that satisfy li[psi(p)]-li[psi(p-1)]<1 (sequence A196667), where li(x) is the logarithmic integral and psi(x) is the Chebyshev's psi function.
%C A196674 THe present sequence lists the zeros of the function c(n)-p_{2n}, where c(n) is the n-th Chebyshev prime and p_{2n} the 2n-th prime.
%C A196674 See A196675 for the Chebyshev primes satisfying a(n)=p_{2n}.
%H A196674 M. Planat and P. Solé, <a href="http://arxiv.org/abs/1109.6489">Efficient prime counting and the Chebyshev primes</a> arXiv:1109.6489 [math.NT]
%K A196674 nonn
%O A196674 1,1
%A A196674 _Michel Planat_, Oct 05 2011