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!)
A218447 a(n) = Sum_{k>=0} floor(n/(5*k + 4)). 3
0, 0, 0, 0, 1, 1, 1, 1, 2, 3, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 9, 9, 9, 11, 11, 11, 12, 14, 15, 15, 15, 16, 16, 17, 17, 19, 19, 20, 21, 22, 22, 23, 23, 25, 26, 26, 26, 28, 29, 29, 29, 30, 30, 32, 32, 34, 35, 36, 37, 38, 38, 38, 39, 41, 41, 41, 41, 43, 44, 45, 45, 48, 48, 49, 49, 51, 51, 52, 53, 54 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,9
COMMENTS
Partial sums of A001899.
LINKS
MAPLE
g:= n -> nops(select(t -> t mod 5 = 4, numtheory:-divisors(n))):
g(0):= 0:
ListTools:-PartialSums(map(g, [$0..100])); # Robert Israel, Apr 29 2021
PROG
(PARI) a(n)=sum(k=0, n, (n\(5*k+4)))
(Maxima) A218447[n]:=sum(floor(n/(5*k+4)), k, 0, n)$
makelist(A218447[n], n, 0, 80); /* Martin Ettl, Oct 20 2012 */
CROSSREFS
Sequence in context: A230418 A037037 A156262 * A305845 A120565 A244989
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 28 2012
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 06:44 EDT 2024. Contains 374731 sequences. (Running on oeis4.)