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.

A167877 Largest m<=n such that no carry occurs when adding m to n in ternary arithmetic.

Table of values

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

List of values

[0, 1, 0, 3, 4, 3, 2, 1, 0, 9, 10, 9, 12, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 27, 28, 27, 30, 31, 30, 29, 28, 27, 36, 37, 36, 39, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2]

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

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