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-3 of 3 results.

A152921 a(n) = 2^(2p-1)/2, where p is A000043(n).

Original entry on oeis.org

4, 16, 256, 4096, 16777216, 4294967296, 68719476736, 1152921504606846976, 1329227995784915872903807060280344576, 95780971304118053647396689196894323976171195136475136, 6582018229284824168619876730229402019930943462534319453394436096
Offset: 1

Views

Author

Omar E. Pol, Dec 15 2008

Keywords

Comments

Ultraperfect numbers (A139306), divided by 2.
Also, a(n) is the largest proper divisor of the n-th ultraperfect number.
The cototient (A051953) of the even perfect numbers (A000396). - Amiram Eldar, Mar 06 2022
These cototients are squares = (2^(p-1))^2. - Bernard Schott, Mar 14 2022

Crossrefs

Programs

  • Mathematica
    a[n_] := 4^(MersennePrimeExponent[n] - 1); Array[a, 12] (* Amiram Eldar, Mar 06 2022 *)

Formula

a(n) = A139306(n)/2.
a(n) = A051953(A000396(n)), if there are no odd perfect numbers. - Amiram Eldar, Mar 06 2022
a(n) = A061652(n)^2. - Bernard Schott, Mar 14 2022

Extensions

More terms from Amiram Eldar, Mar 06 2022

A152923 a(n) = 2^(2*p-1)/8, where p is A000043(n).

Original entry on oeis.org

1, 4, 64, 1024, 4194304, 1073741824, 17179869184, 288230376151711744, 332306998946228968225951765070086144, 23945242826029513411849172299223580994042798784118784, 1645504557321206042154969182557350504982735865633579863348609024
Offset: 1

Views

Author

Omar E. Pol, Dec 15 2008

Keywords

Comments

Ultraperfect numbers (A139306), divided by 8.

Crossrefs

Programs

  • Mathematica
    2^(2 * MersennePrimeExponent[Range[10]] - 4) (* Amiram Eldar, Oct 17 2024 *)

Formula

a(n) = A139306(n)/8 = A152921(n)/4 = A152922(n)/2.

Extensions

a(9)-a(11) from Amiram Eldar, Oct 17 2024

A330841 Numbers of the form 2^(2*p-3)*9*M_p^2, where p > 2 is a Mersenne exponent, A000043, and M_p is the corresponding Mersenne prime, A000668.

Original entry on oeis.org

3528, 1107072, 297289728, 5065312705708032, 332036326796518490112, 85002272432789680816128, 23926103901845565010319828907592777728, 31803247166010917904914435277786533840425989636087697369118739195223867392
Offset: 1

Views

Author

Walter Kehowski, Jan 25 2020

Keywords

Comments

a(1) = 3528 has power-spectral basis {21^2, 28^2, 48^2}, of index 1. If n > 1, then a(n) has power-spectral basis {M^2*(M+2)^2, (1/4)*M^2*(M+1)^2, (M^2-1)^2}, with index 2, where M=A000668(n+1) is the (n+1)-st Mersenne prime. The first element of the spectral basis of a(n), n > 1, is A330819(n+1), the second element is A133051(n+1), and the third element is A330820(n+1). Generally, a power-spectral basis is a spectral basis that consists of primes and powers.
The spectral sum of a(n), that is, the sum of the elements of its spectral basis, is a(1) + 1 whenever n = 1, and 2*a(n)+1 whenever n > 1. In this case, we say that a(n) has index 1 and index 2, respectively.
a(n), n > 1, is also isospectral with 9*A133051(n), that is, a(n) and 9*A133051(n) have the same spectral basis, but 9*A133051(n) has index 1. Thus 9*A133051(n) and a(n) form an isospectral pair.

Examples

			a(2) = 2^(2*5-3)*9*31^2 = 2^7*9*31^2 = 1107072 has spectral basis {1023^2, 496^2, 960^2}, consisting of powers. The spectral sum of a(2), that is, the sum of the elements of its spectral basis, is 2*a(2)+1 = 2214145. In this case we say that a(2) has index 2. The number 9 * A330817(2) = 2^(2*5-2)*9*31^2 = 2^8*9*31^2 = 2214144 has the same spectral basis as a(2), but with index 1. We say that 9 * A330817(2) and a(2) are isospectral and form an isospectral pair.
		

Crossrefs

Programs

  • Maple
    a := proc(n::posint)
    local p, m;
    p:=NumberTheory[IthMersenne](n+1);
    m:=2^p-1;
    return 2^(2*p-3)*9*m^2;
    end;
  • Mathematica
    f[p_] := 9*2^(2*p - 3)*(2^p - 1)^2; f /@ MersennePrimeExponent /@ Range[2, 9] (* Amiram Eldar, Feb 07 2020 *)

Formula

a(n) = A152922(n+1) * 9 * A133049(n+1).
Showing 1-3 of 3 results.