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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066809 a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n. 0
1, 3, 8, 13, 27, 34, 61, 76, 111, 136, 201, 213, 303, 354, 439, 490, 642, 682, 871, 935, 1107, 1234, 1509, 1535, 1834, 2011, 2298, 2438, 2872, 2937, 3432, 3619, 4049, 4350, 4905, 4956, 5658, 6033, 6634, 6844, 7704, 7871, 8816, 9180, 9874, 10421, 11548 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

1 = {1}, 3 = {1}+{0+2}, 8 = {1}+{2+2}+{0+0+3}, 13= {1}+{0+2}+{0+3+3}+{0+0+0+4}, 27= {1}+{2+2}+{3+3+3}+{0+0+4+4}+{0+0+0+0+5}, 34 = {1}+{0+2}+{0+0+3}+{0+4+4+4}+{0+0+0+5+5}+{0+0+0+0+0+6}.

MATHEMATICA

Table[ Sum[ -Mod[ n+c, b ]+Mod[ n, b ]+c, {b, n}, {c, b} ], {n, 64} ]

CROSSREFS

Sequence in context: A146939 A181540 A059028 * A009848 A153891 A056402

Adjacent sequences:  A066806 A066807 A066808 * A066810 A066811 A066812

KEYWORD

nonn

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be), Jan 19 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:48 EST 2012. Contains 205978 sequences.