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.

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

List of values

[0, 1, 2, 3, 4, 0, 6, 6, 6, 6, 0, 6, 12, 12, 12, 0, 6, 12, 18, 18, 0, 6, 12, 18, 24, 0, 26, 26, 26, 26, 0, 31, 31, 31, 31, 0, 36, 36, 36, 36, 0, 41, 41, 41, 41, 0, 46, 46, 46, 46, 0, 26, 52, 52, 52, 0, 31, 57, 57, 57, 0, 36, 62, 62, 62, 0, 41, 67, 67, 67, 0, 46, 72, 72, 72, 0, 26, 52, 78, 78, 0, 31, 57, 83, 83, 0, 36]