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.

A088169 Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have the same number of digits as n.

Table of values

n a(n)
1 0
2 2
3 4
4 6
5 8
6 11
7 22
8 33
9 44
10 55
11 66
12 77
13 88
14 99
15 101
16 141
17 161
18 181
19 201
20 202
21 221
22 222
23 241
24 242
25 261
26 262
27 281
28 282
29 302
30 303
31 322
32 323
33 342
34 343
35 362
36 363
37 382
38 383
39 403
40 404
41 423
42 424
43 443
44 444
45 463
46 464
47 483
48 484
49 504
50 505
51 524
52 525
53 544
54 545
55 564
56 565

List of values

[0, 2, 4, 6, 8, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 141, 161, 181, 201, 202, 221, 222, 241, 242, 261, 262, 281, 282, 302, 303, 322, 323, 342, 343, 362, 363, 382, 383, 403, 404, 423, 424, 443, 444, 463, 464, 483, 484, 504, 505, 524, 525, 544, 545, 564, 565]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.