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.

This page as a plain text file.
%I A065743 #11 Jul 12 2024 10:16:46
%S A065743 1,6,24,36,120,1296,900,840,46656,7560,44100,60466176,810000,83160,
%T A065743 2176782336,2822400,1081080,2821109907456,729000000,101559956668416,
%U A065743 17297280,131621703842267136,1944810000,341510400
%N A065743 Smallest number with exactly A025475(n) divisors.
%C A065743 Note that 2^(n-1) has n divisors. - _David Wasserman_, Sep 09 2002
%H A065743 Amiram Eldar, <a href="/A065743/b065743.txt">Table of n, a(n) for n = 1..285</a>
%F A065743 a(n) = A005179(A025475(n)).
%t A065743 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 & ] ]]
%Y A065743 Cf. A005179, A025475, A037992, A003680.
%K A065743 nonn
%O A065743 1,2
%A A065743 _Labos Elemer_, Nov 15 2001
%E A065743 More terms from _David Wasserman_, Sep 09 2002