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.

A240521 a(n) = A050376(n)*A050376(n+1) where A050376(n) is the n-th number of the form p^(2^k) with p is prime and k >= 0.

Original entry on oeis.org

6, 12, 20, 35, 63, 99, 143, 208, 272, 323, 437, 575, 725, 899, 1147, 1517, 1763, 2021, 2303, 2597, 3127, 3599, 4087, 4757, 5183, 5767, 6399, 6723, 7387, 8633, 9797, 10403, 11021, 11663, 12317, 13673, 15367, 16637, 17947, 19043, 20711, 22499, 23707, 25591
Offset: 1

Views

Author

Vladimir Shevelev, Apr 07 2014

Keywords

Comments

Let m be an odd positive number. Let S_m denote the sequence {Product_{i=1..r} q_(n+t_i)}A050376%20and%20Sum">{n>=1}, where {q_i} is sequence A050376 and Sum{i=1..r} 2^(t_1 - t_i) is the binary representation of m, such that t_1 > t_2 > ... > t_r = 0. Note that {S_1, S_3, S_5, ...} is a partition of all integers > 1. Then S_1=A050376, which is obtained when we set r=1, t_1 = 0. [Formula made compatible with A240535 data by Peter Munn, Aug 10 2021]
This present sequence is S_3 in this partition. It is obtained when we set r=2, t_1=1, t_2=0.
S_m(n) = A052330(A030101(m)*2^(n-1)) = A329330(A050376(n), A052330(A030101(m))). - Peter Munn, Aug 10 2021
A minimal set of generators for A000379 as a group under A059897(.,.). - Peter Munn, Aug 11 2019

Crossrefs

Positions of 3's in A240535.
Sequences for other parts of the partition described in the first comment: A050376 (S_1), A240522 (S_5), A240524 (S_7), A240536 (S_9), A241024 (S_11), A241025 (S_13).

Programs

  • Python
    from sympy import primepi, integer_nthroot
    def A240521(n):
        def bisection(f,kmin=0,kmax=1):
            while f(kmax) > kmax: kmax <<= 1
            kmin = kmax >> 1
            while kmax-kmin > 1:
                kmid = kmax+kmin>>1
                if f(kmid) <= kmid:
                    kmax = kmid
                else:
                    kmin = kmid
            return kmax
        def f(x): return n+x-sum(primepi(integer_nthroot(x,1<Chai Wah Wu, Feb 18-19 2025

Formula

a(n) = A052330(3*2^(n-1)) = A329330(A050376(n), 6). - Peter Munn, Aug 10 2021

Extensions

More terms from Peter J. C. Moses, Apr 18 2014