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.

A290223 Algorithm: s(k) = n. s(k+1) = s(k) - digitsum(s(k))^2 if s(k) >= 0 and s(k+1) = s(k)+digitsum(abs(s(k)))^2 if s(k) < 0. Below gives the end behavior for each number n.

Table of values

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

List of values

[0, 2, 3, 6, 6, 6, 3, 11, 9, 9, 3, 3, 6, 6, 6, 3, 11, 9, 0, 3, 3, 6, 2, 6, 3, 11, 9, 9, 11, 3, 6, 3, 6, 3, 11, 9, 9, 11, 3, 6, 3, 6, 3, 6, 9, 9, 11, 3, 6, 3, 6, 3, 6, 9, 9, 11, 3, 6, 6, 6, 3, 2, 9, 9, 11, 3, 6, 6, 6, 3, 3, 9, 9, 11, 3, 6, 2, 6, 3, 3, 0, 9, 11, 3, 6, 6, 6, 3, 6, 9, 9, 11, 3, 6, 6, 6, 3, 6, 9, 9, 3, 3, 6, 3, 6, 3, 3, 9, 9]