Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086670 Sum of floor(d/2) where d is a divisor of n. +0
1
0, 1, 1, 3, 2, 5, 3, 7, 5, 8, 5, 13, 6, 11, 10, 15, 8, 18, 9, 20, 14, 17, 11, 29, 14, 20, 18, 27, 14, 34, 15, 31, 22, 26, 22, 44, 18, 29, 26, 44, 20, 46, 21, 41, 36, 35, 23, 61, 27, 45, 34, 48, 26, 58, 34, 59, 38, 44, 29, 82, 30, 47, 49, 63, 40, 70, 33, 62, 46, 70, 35, 96, 36, 56 (list; graph; listen)
OFFSET

1,4

EXAMPLE

10 has divisors 1,2,5,10. floor(d/2) gives 0,1,2,5, therefore a(10)=8.

PROGRAM

(PARI) for (n=1, 100, s=0; fordiv(i=n, i, s+=floor(i/2)); print1(", "s))

CROSSREFS

Sequence in context: A083242 A111618 A107128 this_sequence A075888 A075889 A045766

Adjacent sequences: A086667 A086668 A086669 this_sequence A086671 A086672 A086673

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jul 27 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research