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.

A265511 a(n) = largest base-3 palindrome m <= n such that every base-3 digit of m is <= the corresponding digit of n; m is written in base 10.

Table of values

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

List of values

[0, 1, 2, 0, 4, 4, 0, 4, 8, 0, 10, 10, 0, 13, 13, 0, 16, 16, 0, 10, 20, 0, 13, 23, 0, 16, 26, 0, 28, 28, 0, 28, 28, 0, 28, 28, 0, 28, 28, 0, 40, 40, 0, 40, 40, 0, 28, 28, 0, 40, 40, 0, 52, 52, 0, 28, 56, 0, 28, 56, 0, 28, 56, 0, 28, 56, 0, 40, 68, 0, 40, 68, 0, 28, 56, 0, 40, 68, 0, 52, 80, 0, 82, 82, 0, 82, 82, 0, 82]