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.

A056781 Prime powers such that the 4th power of the number of divisors is not smaller than the number itself.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 25, 27, 32, 49, 64, 81, 125, 128, 243, 256, 512, 625, 729, 1024, 2048, 2187, 4096, 6561, 8192, 16384, 32768, 65536
Offset: 1

Views

Author

Labos Elemer, Aug 18 2000

Keywords

Comments

For any integers n, d[n]^4>n should form finite albeit very large sequence.

Examples

			Equality holds in 12 cases: n=6561=3^8,d[n]=9 and d^4=9^4=3^8=n n=625,d[n]=5, so d^4=n
		

Crossrefs

Programs

  • Mathematica
    Select[Select[Range[2^16], PrimePowerQ], DivisorSigma[0, #]^4 >= # &] (* Michael De Vlieger, Jul 15 2017 *)

Formula

p^w<=(w+1)^4 i.e. p<=(w+1)^(4/w) restricts possible primes and their exponents