A228064 - cp's OEIS frontend

A228064 Difference between the number of primes with n digits (A006879) and the nearest integer to F[4n](S(n)), where F[4n](x) are Fibonacci polynomials and S(n) = Sum_{i=0..3} (C(i)(log(log(A(B+n^2))))^i) (see A228063).

n	a(n)
1	0
2	0
3	0
4	-2
5	-8
6	121
7	2645
8	27243
9	209322
10	1179803
11	2299680
12	-61020043
13	-1269344630
14	-17189254160
15	-195686557968
16	-1996027658061
17	-18568445615842
18	-156279759410226
19	-1137747666182762
20	-6044328439309231
21	1630706099481822
22	705861452287757875

[0, 0, 0, -2, -8, 121, 2645, 27243, 209322, 1179803, 2299680, -61020043, -1269344630, -17189254160, -195686557968, -1996027658061, -18568445615842, -156279759410226, -1137747666182762, -6044328439309231, 1630706099481822, 705861452287757875]

cp's OEIS Frontend

A228064 Difference between the number of primes with n digits (A006879) and the nearest integer to F[4n](S(n)), where F[4n](x) are Fibonacci polynomials and S(n) = Sum_{i=0..3} (C(i)(log(log(A(B+n^2))))^i) (see A228063).

Table of values

List of values

cp's OEIS Frontend

A228064 Difference between the number of primes with n digits (A006879) and the nearest integer to F[4n](S(n)), where F[4n](x) are Fibonacci polynomials and S(n) = Sum_{i=0..3} (C(i)*(log(log(A*(B+n^2))))^i) (see A228063).

Table of values

List of values

A228064 Difference between the number of primes with n digits (A006879) and the nearest integer to F[4n](S(n)), where F[4n](x) are Fibonacci polynomials and S(n) = Sum_{i=0..3} (C(i)(log(log(A(B+n^2))))^i) (see A228063).