login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114809 Smallest abundant number with some prime powers fixed by n. 1
12, 945, 20, 18, 12, 5391411025, 12, 12, 12, 81081, 12, 70, 12, 6435, 56, 24, 12, 5775, 12, 18, 20, 945, 12, 20, 20, 945, 18, 18, 12, 20169691981106018776756331, 12, 48, 20, 945, 12, 30, 12, 945, 20, 12, 12, 366005822969340125, 12, 18, 12, 945 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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.

Same as A114371 for squarefree n.

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

LINKS

Table of n, a(n) for n=1..46.

EXAMPLE

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

CROSSREFS

Cf. A005101, A005231, A047802, A114371.

Sequence in context: A283040 A229603 A203599 * A114371 A047802 A278705

Adjacent sequences:  A114806 A114807 A114808 * A114810 A114811 A114812

KEYWORD

nonn

AUTHOR

Hugo van der Sanden, Feb 09 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 29 09:29 EDT 2020. Contains 337428 sequences. (Running on oeis4.)