login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060832 a(n) = Sum_{k>0} floor(n/k!). 2
0, 1, 3, 4, 6, 7, 10, 11, 13, 14, 16, 17, 20, 21, 23, 24, 26, 27, 30, 31, 33, 34, 36, 37, 41, 42, 44, 45, 47, 48, 51, 52, 54, 55, 57, 58, 61, 62, 64, 65, 67, 68, 71, 72, 74, 75, 77, 78, 82, 83, 85, 86, 88, 89, 92, 93, 95, 96, 98, 99, 102, 103, 105, 106, 108, 109, 112, 113 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = a(n-1) + A055881(n).

a(n) = (e-1)*n + f(n) where f(n) < 0. - Benoit Cloitre, Jun 19 2002

f is unbounded in the negative direction. The assertion that f(n) < 0 is correct, since (e-1)*n = Sum_{k>=1} n/k! is term for term >= this sequence. - Franklin T. Adams-Watters, Nov 03 2005

PROG

(PARI) a(n)={my(s=0, d=1, f=1); while (n>=d, s+=n\d; f++; d*=f); s} \\ Harry J. Smith, Jul 12 2009

CROSSREFS

Cf. A013936, A013939, A038663.

Sequence in context: A274429 A050618 A093579 * A047297 A183233 A191926

Adjacent sequences:  A060829 A060830 A060831 * A060833 A060834 A060835

KEYWORD

nonn

AUTHOR

Henry Bottomley, May 01 2001

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 June 15 16:13 EDT 2019. Contains 324142 sequences. (Running on oeis4.)