Logan W. Wilbur - cp's OEIS frontend

User: Logan W. Wilbur

Logan W. Wilbur has authored 2 sequences.

A271565 Number of 8's found in the first differences of a reduced residue system modulo a primorial p#.

0, 0, 0, 2, 28, 394, 6812, 128810, 2918020, 83120450, 2524575200, 91589444450, 3682730287600, 155231331960250, 7156139793803000, 372520258834974250, 21613446896458917500, 1296556574981939521250, 85520460088068245240000, 5980843188551617897761250, 430093937447553491544932500

Offset: 1

Logan W. Wilbur, Apr 10 2016

Technically, the formula is undefined modulo 2# or 3#, but I have listed their values as "0", since there are no 8's in the first differences of their reduced residue systems. For our purposes, by "8's", we mean n such that n,n+8 are relatively prime to the primorial modulus, while n+1,n+2,n+3,n+4,n+5,n+6,n+7 all share a factor (or factors) with p#.

			Modulo 5# (=30), there are (5-2)-2*(5-3)+(5-4)=0 occurrences where n, n+8 are relatively prime but n+1, n+2, n+3, n+4, n+5, n+6, n+7 share a factor with 30.
Modulo 7# (=210), there are (7-2)(5-2)-2*(7-3)(5-3)+(7-4)(5-4)=15-16+3=2 such occurrences; i.e when n=89,113 (mod210).

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.

Cf. A049296, A059861, A271564.

Table[Product[Prime@ k - 2, {k, 3, n}] - 2 Product[Prime@ k - 3, {k, 3, n}] + Product[Prime@ k - 4, {k, 3, n}], {n, 21}] (* Michael De Vlieger, Apr 11 2016 *)

a(n) = prod(k=3, n, prime(k)-2) - 2*prod(k=3, n, prime(k)-3) + prod(k=3, n, prime(k)-4); \\ Michel Marcus, Apr 11 2016

a(n) = product(p-2) - 2*product(p-3) + product(p-4), where p runs through the primes > 3 and <= prime(n).

More terms from Michel Marcus, Apr 11 2016

A271564 Number of 6's found in the first differences of a reduced residue system modulo a primorial p#.

Original entry on oeis.org

0, 0, 2, 14, 142, 1690, 26630, 470630, 10169950, 280323050, 8278462850, 293920842950, 11604850743850, 481192519512250, 21869408938627250, 1124832660535333750, 64590101883781223750, 3837395864206055401250, 250972362651045466681250, 17415757437491856599406250, 1243227958252662737649043750

Offset: 1

Logan W. Wilbur, Apr 09 2016

Technically, the formula is undefined modulo 2# or 3#, but their values are listed as "0", since there are no 6's in the first differences of their reduced residue systems. For our purposes, by "6's", we mean n such that n,n+6 are relatively prime to the primorial modulus, while n+1,n+2,n+3,n+4,n+5 all share a factor (or factors) with p#. The values of this sequence are tied to actual distribution of sexy primes over N (conjecture).

			Modulo 5# (=30), there are (2*(5-2)-2*(5-3))=2 occurrences where n,n+6 are relatively prime, but n+1,n+2,n+3,n+4,n+5 share a factor with 30; they are n=1,n=23(mod30). Modulo 7# (=210), there are (2*(7-2)*(5-2)-2*(7-3)*(5-3))=30-16=14 such occurrences.

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.

Cf. A059861 (d=2,4 values), A049296, A271565.

Table[2 Product[Prime@ k - 2, {k, 3, n}] - 2 Product[Prime@ k - 3, {k, 3, n}], {n, 21}] (* Michael De Vlieger, Apr 11 2016 *)

a(n) = 2*prod(k=3, n, prime(k)-2) - 2*prod(k=3, n, prime(k)-3); \\ Michel Marcus, Apr 10 2016

a(n) = 2*product(p-2)-2*product(p-3), where p runs over the primes greater than 3.

Corrected and extended by Michel Marcus, Apr 10 2016

cp's OEIS Frontend

User: Logan W. Wilbur

A271565 Number of 8's found in the first differences of a reduced residue system modulo a primorial p#.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions