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.

A272231 a(n) = round(n / pi(n)), where pi(n) is the prime-counting function.

This page as a plain text file.
%I A272231 #26 Aug 21 2021 13:23:49
%S A272231 2,2,2,2,2,2,2,2,3,2,2,2,2,3,3,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%T A272231 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,3,4,3,3,4,4,4,4,4,4,4,
%U A272231 4,4,4,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4
%N A272231 a(n) = round(n / pi(n)), where pi(n) is the prime-counting function.
%C A272231 This sequence grows slowly; a(n) reaches 10 at n = 39017.
%F A272231 a(n) = round(n / pi(n)).
%F A272231 a(n) ~ log(n). - _Charles R Greathouse IV_, Apr 30 2016
%t A272231 Table[Round[n/PrimePi@ n], {n, 2, 120}] (* _Michael De Vlieger_, May 20 2016 *)
%o A272231 (PARI) n \/ primepi(n) \\ _Charles R Greathouse IV_, Apr 30 2016
%Y A272231 Cf. A000720, A064658, A107609.
%K A272231 nonn
%O A272231 2,1
%A A272231 _Benjamin Przybocki_, Apr 22 2016