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!)
A355140 n/d(n) rounded to the nearest integer, where d(n) is the number of divisors of n (A000005). 1
1, 1, 2, 1, 3, 2, 4, 2, 3, 3, 6, 2, 7, 4, 4, 3, 9, 3, 10, 3, 5, 6, 12, 3, 8, 7, 7, 5, 15, 4, 16, 5, 8, 9, 9, 4, 19, 10, 10, 5, 21, 5, 22, 7, 8, 12, 24, 5, 16, 8, 13, 9, 27, 7, 14, 7, 14, 15, 30, 5, 31, 16, 11, 9, 16, 8, 34, 11, 17, 9, 36, 6, 37, 19, 13, 13, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
In the ambiguous case, fractions are rounded up.
LINKS
FORMULA
a(n) = round (n / A000005(n)).
EXAMPLE
a(1) = round (1 / 1) = 1;
a(4) = round (4 / 3) = 1;
a(5) = round (5 / 2) = 3;
MATHEMATICA
Table[Floor[n/DivisorSigma[0, n]+1/2], {n, 100}] (* Harvey P. Dale, Dec 22 2022 *)
PROG
(Python)
from sympy import divisor_count
def A355140(n): return (2*n+(d:=divisor_count(n)))//(2*d) # Chai Wah Wu, Jun 20 2022
CROSSREFS
Cf. A000005, A078709 (floor), A334762 (ceiling), A090395 (numerators), A090387 (denominators).
Sequence in context: A346699 A360679 A339894 * A286632 A308453 A286585
KEYWORD
nonn
AUTHOR
Sameer Khan, Jun 20 2022
STATUS
approved

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 August 11 14:50 EDT 2024. Contains 375073 sequences. (Running on oeis4.)