A261677 - cp's OEIS frontend

A261677 Numbers whose representation as a sum of palindromes using the greedy algorithm requires more than are needed using the optimal algorithm.

n	a(n)
1	302
2	403
3	504
4	605
5	706
6	807
7	908
8	1011
9	1013
10	1014
11	1015
12	1016
13	1017
14	1018
15	1019
16	1020
17	1021
18	1022
19	1024
20	1025
21	1026
22	1027
23	1028
24	1029
25	1030
26	1032
27	1033
28	1035
29	1036
30	1037
31	1038
32	1039
33	1040
34	1043
35	1044
36	1046
37	1047
38	1048
39	1049
40	1050
41	1054
42	1055
43	1057
44	1058

[302, 403, 504, 605, 706, 807, 908, 1011, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1032, 1033, 1035, 1036, 1037, 1038, 1039, 1040, 1043, 1044, 1046, 1047, 1048, 1049, 1050, 1054, 1055, 1057, 1058]

cp's OEIS Frontend

A261677 Numbers whose representation as a sum of palindromes using the greedy algorithm requires more than are needed using the optimal algorithm.

Table of values

List of values