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.

A385109 If n is 5 (mod 8) then apply n = (n-1)/4 until the result is not equivalent 5 (mod 8); otherwise a(n) = n.

Table of values

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

List of values

[0, 1, 2, 3, 4, 1, 6, 7, 8, 9, 10, 11, 12, 3, 14, 15, 16, 17, 18, 19, 20, 1, 22, 23, 24, 25, 26, 27, 28, 7, 30, 31, 32, 33, 34, 35, 36, 9, 38, 39, 40, 41, 42, 43, 44, 11, 46, 47, 48, 49, 50, 51, 52, 3, 54, 55, 56, 57, 58, 59, 60, 15, 62, 63, 64, 65, 66, 67, 68, 17, 70, 71, 72, 73, 74, 75, 76, 19]