login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

%I #3 Mar 30 2012 18:37:42

%S 1,3,8,13,27,34,61,76,111,136,201,213,303,354,439,490,642,682,871,935,

%T 1107,1234,1509,1535,1834,2011,2298,2438,2872,2937,3432,3619,4049,

%U 4350,4905,4956,5658,6033,6634,6844,7704,7871,8816,9180,9874,10421,11548

%N a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n.

%e 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}.

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

%K nonn

%O 1,2

%A _Wouter Meeussen_, Jan 19 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 11:53 EDT 2024. Contains 376000 sequences. (Running on oeis4.)