A059865 -id:A059865 - cp's OEIS frontend

A059861 a(n) = Product_{i=2..n} (prime(i) - 2).

1, 1, 3, 15, 135, 1485, 22275, 378675, 7952175, 214708725, 6226553025, 217929355875, 8499244879125, 348469040044125, 15681106801985625, 799736446901266875, 45584977473372211875, 2689513670928960500625

Offset: 1

Labos Elemer, Feb 28 2001

nonn

Arises in Hardy-Littlewood k-tuple conjecture. Also a(n) is the exact number of d=2 and also d=4 differences in dRRS[modulus=n-th primorial]; see A049296 (dRRS[m]=set of first differences of reduced residue system modulo m).
For n>1 this is the determinant of the (n-1) X (n-1) matrix whose diagonal is A006093(n) = {1, 2, 4, 6, 10, 12, 16, 18..} = the first primes minus 1 and all other elements are 1's. The determinant begins: / (2-1) 1 1 1 1 1 1 ... / 1 (3-1) 1 1 1 1 1 ... / 1 1 (5-1) 1 1 1 1 ... / 1 1 1 (7-1) 1 1 1 ... / 1 1 1 1 (11-1) 1 1 ... / 1 1 1 1 1 (13-1) 1 ... - Alexander Adamchuk, May 21 2006
From Gary W. Adamson, Apr 21 2009: (Start)
Equals (-1)^n * (1, 1, 1, 3, 15, ...) dot (1, -2, 4, -6, 10, ...).
a(6) = 135 = (1, 1, 1, 3, 15) dot (1, -2, 4, -6, 10) = (1, -2, 4, -18, 150). (End)

			n=4, a(4) = 1*(3-2)*(5-2)*(7-2) = 15. 48 first terms of A049296 give one complete period of dRRS[210], in which 15 d=2, 15 d=4 and 18 larger differences occur. For n=1, 2, ..., 5 in the periods of length {1, 2, 8, 48, 480, ...} [see A005867] the number of d=2 and also d=4 differences is {1, 1, 3, 15, 135, ..}

Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 84-94.
R. K. Guy, Unsolved Problems in Number Theory, Sections A8, A1.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979.
G. Polya, Mathematics and Plausible Reasoning, Vol. II, Appendix Princeton UP, 1954.

A.H.M. Smeets, Table of n, a(n) for n = 1..100
Steven Brown, Distance between consecutive elements of the multiplicative group of integers modulo n, arXiv:2311.06873 [math.NT], 2023. See Table 1 p. 25.
C. K. Caldwell, Prime k-tuple Conjecture
Steven R. Finch, Hardy-Littlewood Constants [Broken link]
Steven R. Finch, Hardy-Littlewood Constants [From the Wayback machine]
G. H. Hardy and J. E. Littlewood, Some problems of 'Partitio numerorum'; III: on the expression of a number as a sum of primes, Acta Mathematica, Vol. 44, pp. 1-70, 1923.
G. Niklasch, Some number theoretical constants: 1000-digit values [Cached copy]
G. Polya, Heuristic reasoning in the theory of numbers, Am. Math. Monthly, 66 (1959), 375-384.

Cf. A049296, A002110, A005867, A000847, A022008, A051160-A051168, A048298, A059861-A059865, A040976.

Cf. A067549, A006093.

Table[ Det[ DiagonalMatrix[ Table[ Prime[i-1] - 2, {i, 2, n} ] ] + 1 ], {n, 2, 20} ] (* Alexander Adamchuk, May 21 2006 *)
Table[Product[Prime@k - 2, {k, 2, n}], {n, 1, 18}] (* Harlan J. Brothers, Jul 02 2018 *)
a[1] = 1; a[n_] := a[n] = a[n - 1] (Prime[n] - 2);
Table[a[n], {n, 18}]  (* Harlan J. Brothers, Jul 02 2018 *)
Join[{1},FoldList[Times,Prime[Range[2,20]]-2]] (* Harvey P. Dale, Apr 19 2023 *)

a(n) = prod(i=2, n, prime(i)-2); \\ Michel Marcus, Apr 16 2017

a(n) = Det[ DiagonalMatrix[ Table[ Prime[i-1] - 2, {i, 2, n} ] ] + 1 ] for n>1. - Alexander Adamchuk, May 21 2006
a(n) = a(n-1) * (A000040(n) - 2) for n > 1. - A.H.M. Smeets, Dec 14 2019
a(n) = |{r | 0 <= r < primorial(n) and gcd(r, primorial(n)) = 1 and gcd(r + 2, primorial(n)) = 1}|. - Greg Tener, Oct 22 2021

Offset corrected by A.H.M. Smeets, Dec 14 2019

A098012 Triangle read by rows in which the k-th term in row n (n >= 1, k = 1..n) is Product_{i=0..k-1} prime(n-i).

Original entry on oeis.org

2, 3, 6, 5, 15, 30, 7, 35, 105, 210, 11, 77, 385, 1155, 2310, 13, 143, 1001, 5005, 15015, 30030, 17, 221, 2431, 17017, 85085, 255255, 510510, 19, 323, 4199, 46189, 323323, 1616615, 4849845, 9699690, 23, 437, 7429, 96577, 1062347, 7436429, 37182145, 111546435, 223092870

Offset: 1

Alford Arnold, Sep 09 2004

Also, square array A(m,n) in which row m lists all products of m consecutive primes (read by falling antidiagonals). See also A248164. - M. F. Hasler, May 03 2017

			2
3 3*2
5 5*3 5*3*2
7 7*5 7*5*3 7*5*3*2
Or, as an infinite square array:
     2     3     5     7  ... : row 1 = A000040,
     6    15    35    77  ... : row 2 = A006094,
    30   105   385  1001  ... : row 3 = A046301,
   210  1155  5005 17017  ... : row 4 = A046302,
   ..., with col.1 = A002110, col.2 = A070826, col.3 = A059865\{1}. - _M. F. Hasler_, May 03 2017

Reinhard Zumkeller, Rows n = 1..125 of triangle, flattened

Cf. A000040, A002110, A006094, A046301, A046302, A046303.

Cf. A060381 (central terms), A104887, A248147.

P:=Filtered([1..200],IsPrime);;
T:=Flat(List([1..9],n->List([1..n],k->Product([0..k-1],i->P[n-i])))); # Muniru A Asiru, Mar 16 2019

a098012 n k = a098012_tabl !! (n-1) !! (k-1)
a098012_row n = a098012_tabl !! (n-1)
a098012_tabl = map (scanl1 (*)) a104887_tabl
-- Reinhard Zumkeller, Oct 02 2014

T:=(n,k)->mul(ithprime(n-i),i=0..k-1): seq(seq(T(n,k),k=1..n),n=1..9); # Muniru A Asiru, Mar 16 2019

Flatten[ Table[ Product[ Prime[i], {i, n, j, -1}], {n, 9}, {j, n, 1, -1}]] (* Robert G. Wilson v, Sep 21 2004 *)

T098012(n,k)=prod(i=0,k-1,prime(n-i)) \\ "Triangle" variant
A098012(m,n)=prod(i=0,m-1,prime(n+i)) \\ "Square array" variant. - M. F. Hasler, May 03 2017

n-th row = partial products of row n in A104887. - Reinhard Zumkeller, Oct 02 2014

More terms from Robert G. Wilson v, Sep 21 2004

A059862 a(n) = Product_{i=3..n} (prime(i) - 3).

Original entry on oeis.org

1, 1, 2, 8, 64, 640, 8960, 143360, 2867200, 74547200, 2087321600, 70968934400, 2696819507200, 107872780288000, 4746402332672000, 237320116633600000, 13289926531481600000, 770815738825932800000, 49332207284859699200000, 3354590095370459545600000, 234821306675932168192000000

Offset: 1

Labos Elemer, Feb 28 2001

nonn

			For n = 6, a(6) = 640 because:
prime(1..6)-3 = (-1,0,2,4,8,10) -> (1,1,2,4,8,10)
and
1*1*2*4*8*10 = 640. [Example generalized and reformatted per observation of _Jon E. Schoenfield_ by _Harlan J. Brothers_, Jul 15 2018]

Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 84-94.
R. K. Guy, Unsolved Problems in Number Theory, A8, A1
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979.
G. Polya, Mathematics and Plausible Reasoning, Vol. II, Appendix Princeton UP, 1954.

Vincenzo Librandi, Table of n, a(n) for n = 1..200
C. K. Caldwell, Prime k-tuple Conjecture
Steven R. Finch, Hardy-Littlewood Constants [Broken link]
Steven R. Finch, Hardy-Littlewood Constants [From the Wayback machine]
G. H. Hardy and J. E. Littlewood, Some problems of 'Partitio numerorum'; III: on the expression of a number as a sum of primes, Acta Mathematica, Vol. 44, pp. 1-70, 1923.
G. Niklasch, Some number theoretical constants: 1000-digit values [Cached copy]
G. Polya, Heuristic reasoning in the theory of numbers, Am. Math. Monthly, 66 (1959), 375-384.

Cf. A049296, A002110, A005867, A000847, A022008, A051160-A051168, A048298, A059861-A059865.

a:= proc(n) option remember;
      `if`(n<3, 1, a(n-1)*(ithprime(n)-3))
    end:
seq(a(n), n=1..21);  # Alois P. Heinz, Nov 19 2021

Join[{1, 1}, Table[Product[Prime[i] - 3, {i, 3, n}], {n, 3, 19}]] (* Harlan J. Brothers, Jul 02 2018 *)
a[1] = 1; a[2] = 1; a[n_] := a[n] = a[n - 1] (Prime[n] - 3);
Table[a[n], {n, 19}] (* Harlan J. Brothers, Jul 02 2018 *)

a(n) = prod(i=3, n, prime(i) - 3); \\ Michel Marcus, Jul 15 2018

a(1) = a(2) = 1; a(n) = a(n-1) * (prime(n) - 3) for n >= 3. - David A. Corneth, Jul 15 2018

Name clarified, offset corrected by David A. Corneth, Jul 15 2018

A059863 a(n) = Product_{i=3..n} (prime(i)-4).

Original entry on oeis.org

1, 1, 1, 3, 21, 189, 2457, 36855, 700245, 17506125, 472665375, 15597957375, 577124422875, 22507852492125, 967837657161375, 47424045200907375, 2608322486049905625, 148674381704844620625, 9366486047405211099375, 627554565176149143658125, 43301264997154290912410625

Offset: 1

Labos Elemer, Feb 28 2001

nonn

See A059862 for references.
Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 84-94.

C. K. Caldwell, Prime k-tuple Conjecture
Steven R. Finch, Hardy-Littlewood Constants [Broken link]
Steven R. Finch, Hardy-Littlewood Constants [From the Wayback machine]
G. Niklasch, Some number theoretical constants: 1000-digit values [Cached copy]

Cf. A049296, A002110, A005867, A000847, A022008, A051160-A051168, A048298, A059861-A059865.

a(n) = prod(i=3, n, prime(i)-4); \\ Michel Marcus, Aug 25 2019

More terms from Michel Marcus, Aug 25 2019

A059864 a(n) = Product_{i=4..n} (prime(i)-5), where prime(i) is i-th prime.

Original entry on oeis.org

1, 1, 1, 2, 12, 96, 1152, 16128, 290304, 6967296, 181149696, 5796790272, 208684449792, 7930009092096, 333060381868032, 15986898329665536, 863292509801938944, 48344380548908580864, 2997351594032332013568

Offset: 1

Labos Elemer, Feb 28 2001

nonn

Such products arise in Hardy-Littlewood prime k-tuplet conjectural formulas.

Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 84-94.
R. K. Guy, Unsolved Problems in Number Theory, A8, A1
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979.
G. Polya, Mathematics and Plausible Reasoning, Vol. II, Appendix Princeton UP, 1954

G. C. Greubel, Table of n, a(n) for n = 1..350
C. K. Caldwell, Prime k-tuple Conjecture
Steven R. Finch, Hardy-Littlewood Constants [Broken link]
Steven R. Finch, Hardy-Littlewood Constants [From the Wayback machine]
G. H. Hardy and J. E. Littlewood, Some problems of 'partitio numerorum'; III: on the expression of a number as a sum of primes, Acta Mathematica, Vol. 44, pp. 1-70, 1923.
G. Niklasch, Some number theoretical constants: 1000-digit values [Cached copy]
G. Polya, Heuristic reasoning in the theory of numbers, Am. Math. Monthly,66 (1959), 375-384.

Cf. A000847, A002110, A005867, A022008, A048298, A049296, A051160, A051161, A051162.
Cf. A051163, A051164, A051165, A051166, A051167, A051168, A059861, A059862, A059863.
Cf. A059864, A059865.

[n le 3 select 1 else (&*[NthPrime(j) -5: j in [4..n]]): n in [1..30]]; // G. C. Greubel, Feb 02 2023

Join[{1,1,1},FoldList[Times,Prime[Range[4,20]]-5]] (* Harvey P. Dale, Dec 29 2018 *)

a(n) = prod(k=4, n, prime(k)-5); \\ Michel Marcus, Dec 12 2017

def A059864(n): return product(nth_prime(j) -5 for j in range(4,n+1))
[A059864(n) for n in range(1,31)] # G. C. Greubel, Feb 02 2023

cp's OEIS Frontend

A059861 a(n) = Product_{i=2..n} (prime(i) - 2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A098012 Triangle read by rows in which the k-th term in row n (n >= 1, k = 1..n) is Product_{i=0..k-1} prime(n-i).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A059862 a(n) = Product_{i=3..n} (prime(i) - 3).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A059863 a(n) = Product_{i=3..n} (prime(i)-4).

Views

Author

Keywords

References

Links

Crossrefs

Programs

PARI

Extensions

A059864 a(n) = Product_{i=4..n} (prime(i)-5), where prime(i) is i-th prime.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath