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.

A349877 a(n) is the number of times the map x -> A353314(x) needs to be applied to n to reach a multiple of 3, or -1 if the trajectory never reaches a multiple of 3.

Table of values

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

List of values

[0, 2, 14, 0, 1, 13, 0, 4, 1, 0, 12, 3, 0, 1, 3, 0, 4, 1, 0, 11, 2, 0, 1, 2, 0, 2, 1, 0, 2, 3, 0, 1, 3, 0, 10, 1, 0, 4, 5, 0, 1, 7, 0, 3, 1, 0, 3, 2, 0, 1, 2, 0, 2, 1, 0, 2, 4, 0, 1, 9, 0, 3, 1, 0, 3, 4, 0, 1, 5, 0, 6, 1, 0, 4, 2, 0, 1, 2, 0, 2, 1, 0, 2, 7, 0, 1, 4, 0, 6, 1, 0, 6, 3, 0, 1, 3, 0, 5, 1, 0, 8, 2, 0]