login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114809 Smallest abundant number with some prime powers fixed by n. 1

%I #5 Feb 09 2014 22:46:15

%S 12,945,20,18,12,5391411025,12,12,12,81081,12,70,12,6435,56,24,12,

%T 5775,12,18,20,945,12,20,20,945,18,18,12,20169691981106018776756331,

%U 12,48,20,945,12,30,12,945,20,12,12,366005822969340125,12,18,12,945

%N Smallest abundant number with some prime powers fixed by n.

%C If n = prod{ p_i^x_i }, a(n) = prod{ p_i^y_i } then we require y_i = x_i - 1 whenever x_i > 0.

%C Same as A114371 for squarefree n.

%C If k is abundant then k = a(k * prod{ p | k }).

%e 12 = 2^2.3^1, so a(12)=70 is the least abundant 2^1.3^0.k with (k,2.3)=1.

%Y Cf. A005101, A005231, A047802, A114371.

%K nonn

%O 1,1

%A _Hugo van der Sanden_, Feb 09 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)