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.

A096839 Number of primes in the neighborhood of n^2 with radius ceiling(log(n^2)).

This page as a plain text file.
%I A096839 #7 Jul 14 2015 23:20:28
%S A096839 0,3,2,3,2,1,2,3,2,3,0,2,3,4,3,2,2,0,2,2,2,3,1,3,2,3,2,1,1,1,1,3,3,3,
%T A096839 4,5,3,3,1,3,0,1,1,2,3,2,3,3,2,1,2,3,2,2,2,1,3,4,0,2,2,3,1,3,4,3,3,1,
%U A096839 1,2,1,2,2,4,1,2,2,3,1,1,3,2,1,1,2,1,3,2,2,2,3,2,2,3,1,2,3,2,3,2,2,1,3,0,1
%N A096839 Number of primes in the neighborhood of n^2 with radius ceiling(log(n^2)).
%e A096839 n=10: a[10]=3 and the 3 primes in interval [95, 105] around 10^2=100 are {97,101,103}.
%t A096839 f[n_] := (PrimePi[n^2 + Ceiling[Log[n^2]]] - PrimePi[n^2 - Ceiling[Log[n^2]] - 1]); Table[ f[n], {n, 105}] (* _Robert G. Wilson v_, Jul 14 2004 *)
%Y A096839 Cf. A096509-A096523, A096830-A096840.
%K A096839 nonn
%O A096839 1,2
%A A096839 _Labos Elemer_, Jul 14 2004