A334480 -id:A334480 - cp's OEIS frontend

A007528 Primes of the form 6k-1.

5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 197, 227, 233, 239, 251, 257, 263, 269, 281, 293, 311, 317, 347, 353, 359, 383, 389, 401, 419, 431, 443, 449, 461, 467, 479, 491, 503, 509, 521, 557, 563, 569, 587

Offset: 1

N. J. A. Sloane

For values of k see A024898.
Also primes p such that p^q - 2 is not prime where q is an odd prime. These numbers cannot be prime because the binomial p^q = (6k-1)^q expands to 6h-1 some h. Then p^q-2 = 6h-1-2 is divisible by 3 thus not prime. - Cino Hilliard, Nov 12 2008
a(n) = A211890(3,n-1) for n <= 4. - Reinhard Zumkeller, Jul 13 2012
There exists a polygonal number P_s(3) = 3s - 3 = a(n) + 1. These are the only primes p with P_s(k) = p + 1, s >= 3, k >= 3, since P_s(k) - 1 is composite for k > 3. - Ralf Steiner, May 17 2018
From Bernard Schott, Feb 14 2019: (Start)
A theorem due to Andrzej Mąkowski: every integer greater than 161 is the sum of distinct primes of the form 6k-1. Examples: 162 = 5 + 11 + 17 + 23 + 47 + 59; 163 = 17 + 23 + 29 + 41 + 53. (See Sierpiński and David Wells.)
{2,3} Union A002476 Union {this sequence} = A000040.
Except for 2 and 3, all Sophie Germain primes are of the form 6k-1.
Except for 3, all the lesser of twin primes are also of the form 6k-1.
Dirichlet's theorem on arithmetic progressions states that this sequence is infinite. (End)
For all elements of this sequence p=6*k-1, there are no (x,y) positive integers such that k=6*x*y-x+y. - Pedro Caceres, Apr 06 2019

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
A. Mąkowski, Partitions into unequal primes, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astr. Phys. 8 (1960), 125-126.
Wacław Sierpiński, Elementary Theory of Numbers, p. 144, Warsaw, 1964.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, Revised edition, 1997, p. 127.

T. D. Noe, Table of n, a(n) for n = 1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
F. S. Carey, On some cases of the Solutions of the Congruence z^p^(n-1)=1, mod p, Proceedings of the London Mathematical Society, Volume s1-33, Issue 1, November 1900, Pages 294-312.
Amelia Carolina Sparavigna, The Pentagonal Numbers and their Link to an Integer Sequence which contains the Primes of Form 6n-1, Politecnico di Torino (Italy, 2021).
Amelia Carolina Sparavigna, Binary operations inspired by generalized entropies applied to figurate numbers, Politecnico di Torino (Italy, 2021).
Wikipedia, Dirichlet's theorem on arithmetic progressions.

Intersection of A016969 and A000040.
Cf. A003627, A010051, A117047, A132231, A214360, A057145.
Prime sequences A# (k,r) of the form k*n+r with 0 <= r <= k-1 (i.e., primes == r (mod k), or primes p with p mod k = r) and gcd(r,k)=1: A000040 (1,0), A065091 (2,1), A002476 (3,1), A003627 (3,2), A002144 (4,1), A002145 (4,3), A030430 (5,1), A045380 (5,2), A030431 (5,3), A030433 (5,4), A002476 (6,1), this sequence (6,5), A140444 (7,1), A045392 (7,2), A045437 (7,3), A045471 (7,4), A045458 (7,5), A045473 (7,6), A007519 (8,1), A007520 (8,3), A007521 (8,5), A007522 (8,7), A061237 (9,1), A061238 (9,2), A061239 (9,4), A061240 (9,5), A061241 (9,7), A061242 (9,8), A030430 (10,1), A030431 (10,3), A030432 (10,7), A030433 (10,9), A141849 (11,1), A090187 (11,2), A141850 (11,3), A141851 (11,4), A141852 (11,5), A141853 (11,6), A141854 (11,7), A141855 (11,8), A141856 (11,9), A141857 (11,10), A068228 (12,1), A040117 (12,5), A068229 (12,7), A068231 (12,11).
Cf. A034694 (smallest prime == 1 (mod n)).
Cf. A038700 (smallest prime == n-1 (mod n)).
Cf. A038026 (largest possible value of smallest prime == r (mod n)).
Cf. A001359 (lesser of twin primes), A005384 (Sophie Germain primes).
Cf. A048265, A324076.

Filtered(List([1..100],n->6*n-1),IsPrime); # Muniru A Asiru, May 19 2018

a007528 n = a007528_list !! (n-1)
a007528_list = [x | k <- [0..], let x = 6 * k + 5, a010051' x == 1]
-- Reinhard Zumkeller, Jul 13 2012

select(isprime,[seq(6*n-1,n=1..100)]); # Muniru A Asiru, May 19 2018

Select[6 Range[100]-1,PrimeQ]  (* Harvey P. Dale, Feb 14 2011 *)

forprime(p=2, 1e3, if(p%6==5, print1(p, ", "))) \\ Charles R Greathouse IV, Jul 15 2011

forprimestep(p=5,1000,6, print1(p", ")) \\ Charles R Greathouse IV, Mar 03 2025

A003627 \ {2}. - R. J. Mathar, Oct 28 2008
Conjecture: Product_{n >= 1} ((a(n) - 1) / (a(n) + 1)) * ((A002476(n) + 1) / (A002476(n) - 1)) = 3/4. - Dimitris Valianatos, Feb 11 2020
From Vaclav Kotesovec, May 02 2020: (Start)
Product_{k>=1} (1 - 1/a(k)^2) = 9*A175646/Pi^2 = 1/1.060548293.... =4/(3*A333240).
Product_{k>=1} (1 + 1/a(k)^2) = A334482.
Product_{k>=1} (1 - 1/a(k)^3) = A334480.
Product_{k>=1} (1 + 1/a(k)^3) = A334479. (End)
Legendre symbol (-3, a(n)) = -1 and (-3, A002476(n)) = +1, for n >= 1. For prime 3 one sets (-3, 3) = 0. - Wolfdieter Lang, Mar 03 2021

A175646 Decimal expansion of the Product_{primes p == 1 (mod 3)} 1/(1 - 1/p^2).

Original entry on oeis.org

1, 0, 3, 4, 0, 1, 4, 8, 7, 5, 4, 1, 4, 3, 4, 1, 8, 8, 0, 5, 3, 9, 0, 3, 0, 6, 4, 4, 4, 1, 3, 0, 4, 7, 6, 2, 8, 5, 7, 8, 9, 6, 5, 4, 2, 8, 4, 8, 9, 0, 9, 9, 8, 8, 6, 4, 1, 6, 8, 2, 5, 0, 3, 8, 4, 2, 1, 2, 2, 2, 2, 4, 5, 8, 7, 1, 0, 9, 6, 3, 5, 8, 0, 4, 9, 6, 2, 1, 7, 0, 7, 9, 8, 2, 6, 2, 0, 5, 9, 6, 2, 8, 9, 9, 7

Offset: 1

R. J. Mathar, Aug 01 2010

The Euler product of the Riemann zeta function at 2 restricted to primes in A002476, which is the inverse of the infinite product (1-1/7^2)*(1-1/13^2)*(1-1/19^2)*...
There is a complementary Product_{primes p == 2 (mod 3)} 1/(1-1/p^2) = A333240 = 1.4140643908921476375655018190798... such that (this constant here)*1.4140643.../(1-1/3^2) = zeta(2) = A013661.
Because 1/(1-p^(-2)) = 1+1/(p^2-1), the complementary 1.414064... also equals Product_{primes p == 2 (mod 3)} (1+1/(p^2-1)), which appears in Eq. (1.8) of [Dence and Pomerance]. - R. J. Mathar, Jan 31 2013

			1.03401487541434188053903064441304762857896...

Peter Luschny, Table of n, a(n) for n = 1..1000 (terms 1..105 from Vaclav Kotesovec).
Thomas Dence and Carl Pomerance, Euler's Function in Residue Classes, Raman. J., Vol. 2 (1998) pp. 7-20, alternative link.
S. Ettahri, O. Ramare, L. Surel, Fast multi-precision computation of some Euler products, arxiv:1908.06808 (2019), Section 9.
R. J. Mathar, Table of Dirichlet L-series and Prime Zeta Modulo Functions for Small Moduli, arXiv:1008.2547 [math.NT], 2010-2015, p. 26.

Cf. A002476, A004611, A007528, A175647, A301429, A333240, A334478, A334480.

z := n -> Zeta(n)/Im(polylog(n, (-1)^(2/3))):
x := n -> (z(2^n)*(3^(2^n)-1)*sqrt(3)/2)^(1/2^n) / 3:
evalf(4*Pi^2 / (27*mul(x(n), n=1..8)), 106); # Peter Luschny, Jan 17 2021

digits = 105;
precision = digits + 5;
prodeuler[p_, a_, b_, expr_] := Product[If[a <= p <= b, expr, 1], {p, Prime[Range[PrimePi[a], PrimePi[b]]]}];
Lv3[s_] := prodeuler[p, 1, 2^(precision/s), 1/(1 - KroneckerSymbol[-3, p]*p^-s)] // N[#, precision]&;
Lv4[s_] := 2*Im[PolyLog[s, Exp[2*I*Pi/3]]]/Sqrt[3];
Lv[s_] := If[s >= 10000, Lv3[s], Lv4[s]];
gv[s_] := (1 - 3^(-s))*Zeta[s]/Lv[s];
pB = (3/4)*Product[gv[2^n*2]^(2^-(n+1)), {n, 0, 11}] // N[#, precision]&;
pA = Pi^2/9/pB ;
RealDigits[pA, 10, digits][[1]]
(* Jean-François Alcover, Jan 11 2021, after PARI code due to Artur Jasinski *)
S[m_, n_, s_] := (t = 1; sums = 0; difs = 1; While[Abs[difs] > 10^(-digits - 5) || difs == 0, difs = (MoebiusMu[t]/t) * Log[If[s*t == 1, DirichletL[m, n, s*t], Sum[Zeta[s*t, j/m]*DirichletCharacter[m, n, j]^t, {j, 1, m}]/m^(s*t)]]; sums = sums + difs; t++]; sums);
P[m_, n_, s_] := 1/EulerPhi[m] * Sum[Conjugate[DirichletCharacter[m, r, n]] * S[m, r, s], {r, 1, EulerPhi[m]}] + Sum[If[GCD[p, m] > 1 && Mod[p, m] == n, 1/p^s, 0], {p, 1, m}];
Z[m_, n_, s_] := (w = 1; sumz = 0; difz = 1; While[Abs[difz] > 10^(-digits - 5), difz = P[m, n, s*w]/w; sumz = sumz + difz; w++]; Exp[sumz]);
$MaxExtraPrecision = 1000; digits = 121; RealDigits[Chop[N[Z[3,1,2], digits]], 10, digits-1][[1]] (* Vaclav Kotesovec, Jan 15 2021 *)
z[n_] := Zeta[n] / Im[PolyLog[n, (-1)^(2/3)]];
x[n_] := (z[2^n] (3^(2^n) - 1) Sqrt[3]/2)^(1/2^n) / 3;
N[4 Pi^2 / (27 Product[x[n], {n, 8}]), 106] (* Peter Luschny, Jan 17 2021 *)

Equals 2*Pi^2 / (3^(7/2) * A301429^2). - Vaclav Kotesovec, May 12 2020

Equals Sum_{k>=1} 1/A004611(k)^2. - Amiram Eldar, Sep 27 2020

More digits from Vaclav Kotesovec, May 12 2020 and Jun 27 2020

A334479 Decimal expansion of Product_{k>=1} (1 + 1/A007528(k)^3).

Original entry on oeis.org

1, 0, 0, 9, 1, 3, 4, 5, 0, 8, 6, 3, 8, 4, 7, 4, 4, 7, 8, 0, 7, 1, 1, 3, 7, 5, 3, 9, 5, 8, 9, 2, 0, 5, 5, 8, 8, 1, 7, 4, 5, 6, 4, 7, 8, 5, 2, 9, 5, 2, 5, 5, 9, 9, 3, 0, 7, 2, 3, 6, 2, 0, 8, 1, 4, 8, 7, 9, 6, 2, 8, 3, 5, 9, 1, 6, 3, 6, 0, 3, 2, 1, 1, 9, 3, 2, 6, 6, 4, 3, 5, 2, 6, 4, 0, 4, 9, 6, 5, 9, 7, 5, 6, 1, 6

Offset: 1

Vaclav Kotesovec, May 02 2020

In general, for s > 0, Product_{k>=1} (1 + 1/A007528(k)^(2*s+1)) / (1 - 1/A007528(k)^(2*s+1)) = (1 - 1/2^(2*s + 1)) * (3^(2*s + 1) - 1) * (2*s)! * zeta(2*s + 1) / (sqrt(3) * A002114(s) * Pi^(2*s + 1)).
For s > 1, Product_{k>=1} (1 + 1/A007528(k)^s) / (1 - 1/A007528(k)^s) = (2^s - 1) * (3^s - 1) * zeta(s) / (zeta(s, 1/6) - zeta(s, 5/6)).
For s > 1, Product_{k>=1} (1 + 1/A002476(k)^s) * (1 + 1/A007528(k)^s) = 6^s * zeta(s) / ((2^s + 1) * (3^s + 1) * zeta(2*s)).

			1.0091345086384744780711375395892055881745647852...

Cf. A007528, A175646, A334424, A334426, A334480, A334482.

A334479 / A334480 = 91*sqrt(3)*zeta(3)/(6*Pi^3).

A334477 * A334479 = 810*zeta(3)/Pi^6.

More digits from Vaclav Kotesovec, Jun 27 2020

A334478 Decimal expansion of Product_{k>=1} (1 - 1/A002476(k)^3).

Original entry on oeis.org

9, 9, 6, 4, 0, 1, 6, 9, 2, 8, 1, 6, 0, 3, 6, 6, 3, 2, 2, 6, 2, 3, 6, 1, 1, 2, 2, 3, 8, 4, 7, 1, 8, 7, 9, 9, 9, 6, 5, 5, 7, 3, 8, 1, 8, 7, 1, 4, 0, 5, 3, 1, 5, 3, 7, 8, 6, 9, 8, 8, 9, 7, 4, 9, 3, 0, 1, 5, 9, 1, 3, 3, 2, 5, 3, 4, 3, 0, 6, 8, 4, 2, 5, 6, 2, 1, 9, 1, 9, 7, 2, 9, 9, 7, 7, 5, 2, 3, 2, 2, 1, 2, 3, 0, 1, 9

Offset: 0

Vaclav Kotesovec, May 02 2020

In general, for s > 0, Product_{k>=1} (1 + 1/A002476(k)^(2*s+1)) / (1 - 1/A002476(k)^(2*s+1)) = sqrt(3) * (2*Pi)^(2*s + 1) * zeta(2*s + 1) * A002114(s) / ((2^(2*s + 1) + 1) * (3^(2*s + 1) + 1) * (2*s)! * zeta(4*s + 2)).
For s > 1, Product_{k>=1} (1 + 1/A002476(k)^s) / (1 - 1/A002476(k)^s) = (zeta(s, 1/6) - zeta(s, 5/6))*zeta(s) / ((2^s + 1)*(3^s + 1)*zeta(2*s)).
For s > 1, Product_{k>=1} (1 - 1/A002476(k)^s) * (1 - 1/A007528(k)^s) = 6^s / ((2^s - 1)*(3^s - 1)*zeta(s)).

			0.996401692816036632262361122384718799965573818714...

R. J. Mathar, Table of Dirichlet L-series and Prime Zeta Modulo Functions for Small Moduli, arXiv:1008.2547 [math.NT], 2010-2015, p. 26 (case 3 1 3 = 1/A334478).

Cf. A002476, A175646, A334425, A334427, A334477.

A334477 / A334478 = 15*sqrt(3)*zeta(3)/Pi^3.

A334478 * A334480 = 108/(91*zeta(3)).

More digits from Vaclav Kotesovec, Jun 27 2020

cp's OEIS Frontend

A007528 Primes of the form 6k-1.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Maple

Mathematica

PARI

PARI

Formula

A175646 Decimal expansion of the Product_{primes p == 1 (mod 3)} 1/(1 - 1/p^2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A334479 Decimal expansion of Product_{k>=1} (1 + 1/A007528(k)^3).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions

A334478 Decimal expansion of Product_{k>=1} (1 - 1/A002476(k)^3).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions