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!)
A300826 a(n) = n/A125746(n), where A125746(n) gives the smallest divisor d of n such that the sum which includes d and all smaller divisors is >= n. 3
1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

Records occur at 1, 6, 24, 120, 240, 504, 1260, 2520, 5040, 15120, 50400, 55440, ... and they are 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, ...

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

FORMULA

a(n) = n/A125746(n).

PROG

(PARI) A300826(n) = { my(k=0, s=0); fordiv(n, d, k++; s += d; if(s>=n, return(n/d))); };

CROSSREFS

Cf. A125746.

Cf. A005100 (positions of ones), A023196 (positions of terms > 1).

Sequence in context: A073700 A226957 A108775 * A334926 A305936 A339790

Adjacent sequences:  A300823 A300824 A300825 * A300827 A300828 A300829

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 21 2018

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 October 17 16:06 EDT 2021. Contains 348065 sequences. (Running on oeis4.)