cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A131489 Partial products of A092680.

Original entry on oeis.org

3, 18, 1728, 679477248
Offset: 1

Views

Author

Jonathan Vos Post, Jul 28 2007

Keywords

Comments

Max Alekseyev points out that every term of A066466, except 4, must be of the form 3*2^k such that 3*2^(k+1)-1, 3*2^(k+1)+1 are twin primes. There are no such new k+1 (i.e., except known 1,2,6,18) below 1000. In other words, 3*2^n - 1, 3*2^n + 1 are twin primes for n=1,2,6,18. According to these tables in the Keller links there are no other such n up to 18*10^6. Therefore the next term of A066466 (if it exists) is greater than 3*2^(18*10^6) ~= 10^5418540. Hence the next element of the anti-primorials (if it exists) is greater than 679477248 * 10^5418540 > 10^5418548. [Updated by Max Alekseyev, May 23 2023]

Examples

			a(1) = 3.
a(2) = 3 * 6 = 18.
a(3) = 3 * 6 * 96 = 1728.
a(4) = 3 * 6 * 96 * 393216 = 679477248.
		

Crossrefs

Cf. A092680.

Formula

a(n) = Product_{k=1..n} A092680(k).

A092679 Numbers k such that 3*2^k has only one anti-divisor.

Original entry on oeis.org

0, 1, 5, 17
Offset: 1

Views

Author

Lior Manor, Mar 03 2004

Keywords

Comments

Next term should be greater than 3*10^6 (cf. A181490).
See A066272 for definition of anti-divisor.

Crossrefs

Programs

  • Python
    A092679 = [i for i,n in enumerate(map(lambda x:3*2**x,range(20))) if len([d for d in range(2,n,2) if n%d and not 2*n%d]+[d for d in range(3,n,2) if n%d and 2*n%d in [d-1,1]])==1] # Chai Wah Wu, Aug 09 2014

Formula

A092680(n) = 3*2^a(n).
a(n) = A181490(n) - 1. - Max Alekseyev, Feb 14 2025
Showing 1-2 of 2 results.