Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065743
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065743 Smallest number with exactly A025475(n) divisors. +0
1
1, 6, 24, 36, 120, 1296, 900, 840, 46656, 7560, 44100, 60466176, 810000, 83160, 2176782336, 2822400, 1081080, 2821109907456, 729000000, 101559956668416, 17297280, 131621703842267136, 1944810000, 341510400 (list; graph; listen)
OFFSET

1,2

COMMENT

Note that 2^(n-1) has n divisors. - David Wasserman (wasserma(AT)spawar.navy.mil), Sep 09 2002

FORMULA

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

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 & ] ]]

CROSSREFS

Cf. A005179, A025475, A037992, A003680

Adjacent sequences: A065740 A065741 A065742 this_sequence A065744 A065745 A065746

Sequence in context: A132398 A073120 A128459 this_sequence A082195 A063961 A112423

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 15 2001

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Sep 09 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research