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.

A200758 Superimperfect numbers.

Original entry on oeis.org

2, 4, 8, 128, 32768, 2147483648
Offset: 1

Views

Author

Laszlo Toth, Nov 22 2011

Keywords

Comments

A number n is said to be superimperfect if 2*beta(beta(n)) = n, where beta is the multiplicative function defined by beta(p^e) = p^e - p^(e-1) + p^(e-2) - ... + (-1)^e for every prime power p^e. The function beta is called the alternating sum-of-divisors function. Here beta(n) is the absolute value of A061020(n). There are no other superimperfect numbers up to 10^7. The number 2^(2^k-1) is superimperfect if and only if k=1,2,3,4,5.

Crossrefs

Programs

  • PARI
    beta(n)=sumdiv(n,d,(-1)^bigomega(n/d)*d)
    for(n=1,1e8,if(2*beta(beta(n))==n,print1(n", "))) \\ Charles R Greathouse IV, Nov 22 2011
    
  • PARI
    ak(p,e)=my(s=1); for(i=1,e, s=s*p + (-1)^i); s
    beta(n)=my(f=factor(n)); prod(i=1,#f~, ak(f[i,1],f[i,2]))
    is(n)=my(b=beta(n)); 2*b-2 >= n && 2*beta(b)==n \\ Charles R Greathouse IV, Dec 27 2016