Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130279
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130279 Smallest number having exactly n square divisors. +0
5
1, 4, 16, 36, 256, 144, 4096, 576, 1296, 2304, 1048576, 3600, 16777216, 36864, 20736, 14400, 4294967296, 32400, 68719476736, 57600, 331776, 9437184, 17592186044416, 129600, 1679616, 150994944, 810000, 921600, 72057594037927936 (list; graph; listen)
OFFSET

1,2

COMMENT

A046951(a(n)) = n and A046951(m) <> n for m < a(n);

all terms are smooth squares: if prime(k) is a factor of a(n) then also prime(i) are factors, i<k;

a(p) = 2^(2*(p-1)) for primes p;

if prime(j) is the greatest prime factor of a(n) then a(2*n) = a(n)*prime(j+1)^2;

A001221(a(n)) = A122375(n); A001222(a(n)) = 2*A122376(n).

LINKS

Eric Weisstein's World of Mathematics, Smooth Number

CROSSREFS

Sequence in context: A136404 A046952 A081456 this_sequence A030158 A054246 A080709

Adjacent sequences: A130276 A130277 A130278 this_sequence A130280 A130281 A130282

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2007

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research