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.

A063056 a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063055 in order to obtain a term in the trajectory of 1997.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 2
8 2
9 2
10 2
11 2
12 2
13 2
14 1
15 1
16 1
17 2
18 2
19 2
20 2
21 2
22 2
23 2
24 2
25 2
26 1
27 0
28 3
29 3
30 3
31 3
32 3
33 1
34 3
35 0
36 3
37 1
38 3
39 3
40 3
41 3
42 3
43 1
44 3
45 1
46 3
47 1
48 3
49 3
50 3
51 3
52 3
53 1
54 3
55 1
56 3
57 1
58 3
59 3
60 3
61 3
62 1
63 3
64 3
65 1
66 3
67 3
68 3
69 3
70 3
71 1
72 3
73 1
74 3
75 1
76 3
77 3
78 3
79 3
80 3
81 1
82 3
83 1
84 3
85 1
86 3
87 3
88 3
89 3
90 3
91 1
92 3
93 1
94 3
95 1
96 2
97 2
98 2
99 3
100 2
101 3
102 2
103 1
104 3

List of values

[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 3, 3, 3, 3, 3, 1, 3, 0, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 1, 3, 3, 3, 3, 1, 3, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 1, 2, 2, 2, 3, 2, 3, 2, 1, 3]