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.

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

This page as a plain text file.
%I A096837 #8 Nov 16 2019 20:09:24
%S A096837 0,3,3,2,2,2,3,2,2,1,0,1,3,3,1,2,1,0,6,1,2,2,3,1,1,3,3,1,0,3,2,4,2,2,
%T A096837 4,3,2,1,5,1,1,2,3,1,3,0,2,1,3,2,1,0,4,1,2,2,2,2,1,0,1,3,2,1,0,0,2,1,
%U A096837 3,1,1,2,1,0,2,3,5,3,3,0,3,2,2,4,4,0,6,2,1,2,1,3,3,2,1,3,2,2,1,4,1,6,0,2,1
%N A096837 Number of primes in the neighborhood of n^n with radius ceiling(log(n^n)).
%F A096837 a(n) almost equals A096509(n^n) >= a(n) because here only primes are counted, the true prime powers not.
%e A096837 a(3)=3 and the 3 primes in [23,31] are {23,29,31}.
%Y A096837 Cf. A096509-A096523, A096830-A096840.
%K A096837 nonn
%O A096837 1,2
%A A096837 _Labos Elemer_, Jul 14 2004