A227694 Difference between pi(10^n) and nearest integer to (F[2n+1](S(n)))^2 where pi(10^n) = number of primes <= 10^n (A006880), F[2n+1](x) are Fibonacci polynomials of odd indices [2n+1] and S(n) = Sum_{i=0..2} (C(i)*(log(log(A*(B+n^2))))^(2i)) (see A227693).
0, 0, 0, 0, -3, -29, 171, 2325, 13809, 33409, -443988, -8663889, -99916944, -927360109, -7318034084, -47993181878, -223530657736, 810207694, 16558446000251, 257071298610935, 2657469557986545, 18804132783879606, 24113768300809752, -2232929440358147845, -54971510676262602742
Offset: 1
Keywords
References
- Jonathan Borwein, David H. Bailey, Mathematics by Experiment, A. K. Peters, 2004, p. 65 (Table 2.2).
- John H. Conway and R. K. Guy, The Book of Numbers, Copernicus, an imprint of Springer-Verlag, NY, 1996, page 144.
Links
- Eric Weisstein's World of Mathematics, Prime Counting Function.
- Eric Weisstein's World of Mathematics, Riemann Prime Number Formula.
Comments