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.

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

List of values

[0, 1, 2, 3, 4, 5, 6, 0, 8, 8, 8, 8, 8, 8, 0, 8, 16, 16, 16, 16, 16, 0, 8, 16, 24, 24, 24, 24, 0, 8, 16, 24, 32, 32, 32, 0, 8, 16, 24, 32, 40, 40, 0, 8, 16, 24, 32, 40, 48, 0, 50, 50, 50, 50, 50, 50, 0, 57, 57, 57, 57, 57, 57, 0, 64, 64, 64, 64, 64, 64, 0, 71, 71, 71, 71, 71, 71, 0, 78, 78, 78, 78, 78, 78, 0, 85, 85]