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.

A062932 a(0) = 0; a(n) = smallest number > a(n-1) such that a(n-1)+a(n) is a palindrome.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 16
8 17
9 27
10 28
11 38
12 39
13 49
14 50
15 51
16 60
17 61
18 70
19 71
20 80
21 81
22 90
23 91
24 100
25 102
26 110
27 112
28 120
29 122
30 130
31 132
32 140
33 142
34 150
35 153
36 160
37 163
38 170
39 173
40 180
41 183
42 190
43 193
44 200
45 204
46 210
47 214
48 220
49 224
50 230
51 234
52 240
53 244
54 250
55 255
56 260
57 265
58 270

List of values

[0, 1, 2, 3, 4, 5, 6, 16, 17, 27, 28, 38, 39, 49, 50, 51, 60, 61, 70, 71, 80, 81, 90, 91, 100, 102, 110, 112, 120, 122, 130, 132, 140, 142, 150, 153, 160, 163, 170, 173, 180, 183, 190, 193, 200, 204, 210, 214, 220, 224, 230, 234, 240, 244, 250, 255, 260, 265, 270]

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

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