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!)
A096143 a(n) = ceiling(Sum_{i=1..n} 1/i). 1
1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = ceiling(A001008(n)/A002805(n)). - Michel Marcus, Jul 11 2013
EXAMPLE
a(4)=3 because the ceiling of 1 + 1/2 + 1/3 + 1/4 is 3.
MATHEMATICA
Ceiling[HarmonicNumber[Range[110]]] (* Harvey P. Dale, Aug 27 2014 *)
PROG
(PARI) a(n) = ceil(sum(i=1, n, 1/i)) \\ Michel Marcus, Jul 11 2013
CROSSREFS
Sequence in context: A257244 A130147 A345377 * A025792 A119447 A157720
KEYWORD
nonn,easy
AUTHOR
W. Neville Holmes, Jul 24 2004
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 July 29 13:25 EDT 2024. Contains 374734 sequences. (Running on oeis4.)