A197297 -id:A197297 - cp's OEIS frontend

A197298 The Riemann primes of the theta type and index 2.

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 43, 47, 59, 73, 97, 107, 109, 139, 179, 233, 263, 277, 283, 337, 347, 409, 419, 547, 643, 683, 809, 811, 821, 823, 863, 983, 991, 997, 1031, 1193

Offset: 1

Michel Planat, Oct 13 2011

nonn

The sequence consists of the prime numbers p that are champions (left to right maxima) of the function |theta(p^2)-p^2|, where theta(p) is the Chebyshev theta function.

Dana Jacobsen, Table of n, a(n) for n = 1..173
M. Planat and P. Solé, Efficient prime counting and the Chebyshev primes arXiv:1109.6489 [math.NT], 2011.

Cf. A196668, A197186, A197297, A197299, A197300.

use ntheory ":all"; my($max,$f)=(0); forprimes { $f=abs(chebyshev_theta($**2)-$**2); if ($f > $max) { say; $max=$f; } } 10000; # Dana Jacobsen, Dec 29 2015

A197299 The Riemann primes of the theta type and index 3.

Original entry on oeis.org

2, 3, 5, 7, 13, 17, 23, 31, 37, 41, 43, 47, 53, 59, 67, 73, 83, 89, 101, 103, 137, 163, 167, 179, 197, 211, 223, 239, 251, 277, 331, 379, 397, 431, 463, 467, 521, 577, 593, 601, 613, 617, 719, 809, 881, 919, 967, 1091, 1123, 1129, 1237, 1249, 1289

Offset: 1

Michel Planat, Oct 13 2011

nonn

The sequence consists of the prime numbers p that are champions (left to right maxima) of the function |theta(p^3)-p^3|, where theta(p) is the Chebyshev theta function.

Dana Jacobsen, Table of n, a(n) for n = 1..85
M. Planat and P. Solé, Efficient prime counting and the Chebyshev primes arXiv:1109.6489 [math.NT]

Cf. A196669, A197187, A197297, A197298, A197300.

use ntheory ":all"; my($max,$f)=(0); forprimes { $f=abs(chebyshev_theta($**3)-$**3); if ($f > $max) { say; $max=$f; } } 1000; # Dana Jacobsen, Dec 28 2015

More terms from Dana Jacobsen, Dec 28 2015

A197300 The Riemann primes of the theta type and index 4.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 37, 47, 59, 61, 67, 71, 89, 97, 109, 137, 139, 167, 173, 191, 223, 229, 239, 241, 269, 271, 293, 311, 331, 347, 367, 401, 431, 433, 457, 503, 509, 571, 577, 661, 709, 719, 733, 739, 797, 911, 919, 1009

Offset: 1

Michel Planat, Oct 13 2011

nonn

The sequence consists of the prime numbers p that are champions (left to right maxima) of the function |theta(p^4)-p^4|, where theta(p) is the Chebyshev theta function, theta(x) = sum_{primes p <=x } log p.

M. Planat and P. Solé, Efficient prime counting and the Chebyshev primes, arXiv:1109.6489 [math.NT]

Cf. A035158, A196670, A197188, A197297, A197298, A197299.

use ntheory ":all"; my($max,$f)=(0); forprimes { $f=abs(chebyshev_theta($**4)-$**4); if ($f > $max) { say; $max=$f; } } 1000; # Dana Jacobsen, Dec 28 2015

More terms from Dana Jacobsen, Dec 28 2015

cp's OEIS Frontend

A197298 The Riemann primes of the theta type and index 2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Perl

A197299 The Riemann primes of the theta type and index 3.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Perl

Extensions

A197300 The Riemann primes of the theta type and index 4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Perl

Extensions