cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A024930 a(n) = sum of remainders of n mod 1,3,5,...,2k-1, where k = [ (n+1)/2 ].

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 1
7 3
8 6
9 6
10 5
11 9
12 11
13 16
14 15
15 13
16 20
17 27
18 23
19 31
20 35
21 34
22 33
23 43
24 51
25 57
26 56
27 56
28 62
29 75
30 66
31 80
32 95
33 96
34 95
35 99
36 104
37 121
38 120
39 122
40 136
41 155
42 144
43 164
44 174
45 163
46 162
47 184
48 204
49 220
50 214
51 218
52 230
53 255
54 242
55 252
56 272
57 277
58 276
59 304
60 310
61 339
62 338
63 328
64 359
65 372
66 357

List of values

[0, 0, 0, 1, 2, 1, 3, 6, 6, 5, 9, 11, 16, 15, 13, 20, 27, 23, 31, 35, 34, 33, 43, 51, 57, 56, 56, 62, 75, 66, 80, 95, 96, 95, 99, 104, 121, 120, 122, 136, 155, 144, 164, 174, 163, 162, 184, 204, 220, 214, 218, 230, 255, 242, 252, 272, 277, 276, 304, 310, 339, 338, 328, 359, 372, 357]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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