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.

A122002 a(0)=5; otherwise a(n) = (n mod 4) if n is odd, a(n) = h + 4, where h = (highest odd divisor of n) mod 4 if n is even.

Table of values

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

List of values

[5, 1, 5, 3, 5, 1, 7, 3, 5, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 7, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 5, 1, 5, 3, 7, 1, 7, 3, 7, 1, 5, 3, 5, 1, 7, 3, 7, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 5, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 7, 1, 5, 3, 7, 1, 7, 3, 7, 1, 5, 3, 5]