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.

A330401 Lexicographically earliest sequence of distinct positive terms with an associate sequence t such that t(0) = 0, and for any n > 0, at least one of t(n-1) - a(n) or t(n-1) + a(n) is a palindrome; in case t(n-1) - a(n) is a palindrome, set t(n) = t(n-1) - a(n), otherwise set t(n) = t(n-1) + a(n).

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 8, 7, 18, 11, 9, 20, 13, 24, 22, 10, 21, 14, 25, 26, 15, 16, 27, 28, 17, 19, 30, 29, 40, 33, 44, 46, 35, 36, 47, 48, 37, 38, 49, 50, 39, 41, 52, 51, 62, 45, 12, 32, 43, 23, 34, 54, 60, 31, 61, 71, 81, 63, 53, 42, 55, 57, 68, 66, 72, 70, 79]

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

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