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

A007539 a(n) = first n-fold perfect (or n-multiperfect) number.

Original entry on oeis.org

1, 6, 120, 30240, 14182439040, 154345556085770649600, 141310897947438348259849402738485523264343544818565120000
Offset: 1

Views

Author

Keywords

Comments

On the Riemann Hypothesis, a(n) > exp(exp(n / e^gamma)) for n > 3. Unconditionally, a(n) > exp(exp(0.9976n / e^gamma)) for n > 3, where the constant is related to A004394(1000000). - Charles R Greathouse IV, Sep 06 2012
Each of the terms 1, 6, 120, 30240 divides all larger terms <= a(8). See A227765, A227766, ..., A227769. - Jonathan Sondow, Jul 30 2013
Is a(n) < a(n+1)? - Jeppe Stig Nielsen, Jun 16 2015
Equivalently, a(n) is the smallest number k such that sigma(k)/k = n. - Derek Orr, Jun 19 2015
The number of divisors of these terms are: 1, 4, 16, 96, 1920, 110592, 1751777280, 63121588161085440. - Michel Marcus, Jun 20 2015
Given n, let S_n be the sequence of integers k that satisfy numerator(sigma(k)/k) = n. Then a(n) is a member of S_n. In fact a(n) = S_n(i), where the successive values of i are 1, 1, 2, 2, 4, 2, (23, 6, 31, 12, ...), where the terms in parentheses need to be confirmed. - Michel Marcus, Nov 22 2015
The first four terms are the only multiperfect numbers in A025487 among the 1600 initial terms of A007691. Can it be proved that these are the only ones among the whole A007691? See also A349747. - Antti Karttunen, Dec 04 2021

References

  • A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 22.
  • A. Brousseau, Number Theory Tables. Fibonacci Association, San Jose, CA, 1973, p. 138.
  • R. K. Guy, Unsolved Problems in Number Theory, B2.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    Table[k = 1; While[DivisorSigma[1, k]/k != n, k++]; k, {n, 4}] (* Michael De Vlieger, Jun 20 2015 *)
  • PARI
    a(n)=k=1;while((sigma(k)/k)!=n,k++);k
    vector(4,n,a(n)) \\ Derek Orr, Jun 19 2015

Extensions

More terms sent by Robert G. Wilson v, Nov 30 2000

A227765 First n-fold perfect number divided by 6, or 0 if the quotient is not an integer.

Original entry on oeis.org

0, 1, 20, 5040, 2363739840, 25724259347628441600, 23551816324573058043308233789747587210723924136427520000
Offset: 1

Views

Author

Jonathan Sondow, Jul 29 2013

Keywords

Comments

The first n-fold perfect numbers are A007539(n) = 1, 6, 120, 30240, 14182439040, ..., for n = 1, 2, 3, 4, 5, ...
The first n-fold perfect numbers divided by 120 is A227766.
The first n-fold perfect numbers divided by 30240 is A227767.
The first n-fold perfect numbers divided by 14182439040 is A227768.
For additional comments, references, links, and cross-refs, see A007539.

Examples

			The first 3-fold perfect number is A007539(3) = 120, so a(3) = 120/6 = 20.
		

Crossrefs

Formula

a(n) = A007539(n)/6 if 2 <= n <= 8.

A227767 First n-fold perfect number divided by 30240, or 0 if the quotient is not an integer.

Original entry on oeis.org

0, 0, 0, 1, 468996, 5104019711831040, 4672979429478781357799252736061029208476969074688000
Offset: 1

Views

Author

Jonathan Sondow, Jul 29 2013

Keywords

Comments

The first n-fold perfect numbers are A007539(n) = 1, 6, 120, 30240, 14182439040, ..., for n = 1, 2, 3, 4, 5, ...
For additional comments, references, links, and cross-refs, see A007539 and A227765.

Examples

			The first 5-fold perfect number is A007539(5) = 14182439040, so a(5) = 14182439040/30240 = 468996.
		

Crossrefs

Formula

a(n) = A007539(n)/30240 if 4 <= n <= 8.

A227768 First n-fold perfect number divided by 14182439040, or 0 if the quotient is not an integer.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 9963793783910270786529635084437882643939328000
Offset: 1

Views

Author

Jonathan Sondow, Jul 29 2013

Keywords

Comments

The first n-fold perfect numbers are A007539(n) = 1, 6, 120, 30240, 14182439040, .., for n = 1, 2, 3, 4, 5, ...
For additional comments, references, links, and cross-refs, see A007539 and A227765.

Examples

			The first 6-fold perfect number is A007539(6) = 154345556085770649600, and 154345556085770649600/14182439040 = 119711504640/11 is not an integer, so a(6) = 0.
		

Crossrefs

Formula

a(n) = A007539(n)/14182439040 for n = 5, 7, 8.

A227769 First (n+1)-fold perfect number divided by first n-fold perfect number, or 0 if the quotient is not an integer.

Original entry on oeis.org

6, 20, 252, 468996, 0, 0, 0
Offset: 1

Views

Author

Jonathan Sondow, Jul 30 2013

Keywords

Comments

The first n-fold perfect numbers are A007539 = 1, 6, 120, 30240, 14182439040, 154345556085770649600, ...
For additional comments, references, links, and crossrefs, see A007539 and A227765.

Examples

			The first 4-fold and 5-fold perfect numbers are A007539(4) = 30240 and  A007539(5) = 14182439040, and 14182439040/30240 = 468996 is an integer, so a(4) = 468996.
		

Crossrefs

Formula

a(n) = A007539(n+1)/A007539(n) if n < 5.
Showing 1-5 of 5 results.