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.

A330349 a(n) = A070826(n+1) - 2^(n-1).

Original entry on oeis.org

2, 13, 101, 1147, 14999, 255223, 4849781, 111546307, 3234846359, 100280244553, 3710369066381, 152125131761557, 6541380665830919, 307444891294237513, 16294579238595005981, 961380175077106286767
Offset: 1

Views

Author

Ahmad J. Masad, Dec 11 2019

Keywords

Comments

Conjecture: For each value of n, the power of each prime number in the prime factorization of a(n) is equal to 1.

Examples

			a(4) = 1147 = 31*37.
a(10) = A070826(11) - 2^9 = 100280245065 - 512 = 100280244553 = A000040(4129119109).
		

Crossrefs

Programs

  • PARI
    a(n) = prod(k=1, n+1, prime(k))/2  - 2^(n-1); \\ Michel Marcus, Dec 11 2019
    
  • Python
    from sympy import primorial
    def A330349(n): return (primorial(n+1)>>1)-(1<Chai Wah Wu, Jul 21 2022