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.

A014841 Sum modulo the base of all the digits of n in every base from 2 to n-1.

Table of values

n a(n)
3 0
4 3
5 2
6 7
7 6
8 13
9 13
10 18
11 19
12 31
13 24
14 37
15 40
16 48
17 48
18 65
19 59
20 79
21 76
22 85
23 93
24 117
25 105
26 121
27 132
28 148
29 143
30 176
31 163
32 193
33 191
34 208
35 226
36 250
37 225
38 262
39 277
40 302
41 290
42 332
43 320
44 359
45 363
46 376
47 394
48 444
49 419
50 455
51 462
52 491
53 495
54 551
55 540
56 577
57 564
58 601
59 625

List of values

[0, 3, 2, 7, 6, 13, 13, 18, 19, 31, 24, 37, 40, 48, 48, 65, 59, 79, 76, 85, 93, 117, 105, 121, 132, 148, 143, 176, 163, 193, 191, 208, 226, 250, 225, 262, 277, 302, 290, 332, 320, 359, 363, 376, 394, 444, 419, 455, 462, 491, 495, 551, 540, 577, 564, 601, 625]