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.

A049803 a(n) = n mod 3 + n mod 9 + ... + n mod 3^k, where 3^k <= n < 3^(k+1).

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 0
7 1
8 2
9 0
10 2
11 4
12 3
13 5
14 7
15 6
16 8
17 10
18 0
19 2
20 4
21 3
22 5
23 7
24 6
25 8
26 10
27 0
28 3
29 6
30 6
31 9
32 12
33 12
34 15
35 18
36 9
37 12
38 15
39 15
40 18
41 21
42 21
43 24
44 27
45 18
46 21
47 24
48 24
49 27
50 30
51 30
52 33
53 36
54 0
55 3
56 6
57 6
58 9
59 12
60 12
61 15
62 18
63 9
64 12
65 15
66 15
67 18
68 21
69 21
70 24
71 27
72 18

List of values

[0, 0, 0, 1, 2, 0, 1, 2, 0, 2, 4, 3, 5, 7, 6, 8, 10, 0, 2, 4, 3, 5, 7, 6, 8, 10, 0, 3, 6, 6, 9, 12, 12, 15, 18, 9, 12, 15, 15, 18, 21, 21, 24, 27, 18, 21, 24, 24, 27, 30, 30, 33, 36, 0, 3, 6, 6, 9, 12, 12, 15, 18, 9, 12, 15, 15, 18, 21, 21, 24, 27, 18]