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.

A065743 Smallest number with exactly A025475(n) divisors.

Original entry on oeis.org

1, 6, 24, 36, 120, 1296, 900, 840, 46656, 7560, 44100, 60466176, 810000, 83160, 2176782336, 2822400, 1081080, 2821109907456, 729000000, 101559956668416, 17297280, 131621703842267136, 1944810000, 341510400
Offset: 1

Views

Author

Labos Elemer, Nov 15 2001

Keywords

Comments

Note that 2^(n-1) has n divisors. - David Wasserman, Sep 09 2002

Crossrefs

Programs

  • Mathematica
    a = Table[ 0, {1024} ]; Do[ b = DivisorSigma[ 0, n]; If[ b < 1025 && a[[b]] == 0, a[[b]] = n], {n, 1, 10^8/2} ]; a[[ Select[ Range[2, 1024], !PrimeQ[ # ] && Mod[ #, # - EulerPhi[ # ]] == 0 & ] ]]

Formula

a(n) = A005179(A025475(n)).

Extensions

More terms from David Wasserman, Sep 09 2002