A265512 - cp's OEIS frontend

A265512 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 3.

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

[0, 1, 2, 0, 11, 11, 0, 11, 22, 0, 101, 101, 0, 111, 111, 0, 121, 121, 0, 101, 202, 0, 111, 212, 0, 121, 222, 0, 1001, 1001, 0, 1001, 1001, 0, 1001, 1001, 0, 1001, 1001, 0, 1111, 1111, 0, 1111, 1111, 0, 1001, 1001, 0, 1111, 1111, 0, 1221, 1221, 0, 1001, 2002, 0, 1001, 2002, 0, 1001, 2002, 0, 1001, 2002, 0, 1111, 2112]

cp's OEIS Frontend

A265512 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 3.

Table of values

List of values