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.

A318724 Let f(0) = 0 and f(t*4^k + u) = i^t * ((1+i) * 2^k - f(u)) for any t in {1, 2, 3} and k >= 0 and u such that 0 <= u < 4^k (i denoting the imaginary unit); for any n >= 0, let g(n) = (f(A042968(n)) - 1 - i) / 2; a(n) is the square of the modulus of g(n).

Table of values

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

List of values

[1, 2, 1, 2, 5, 4, 5, 8, 5, 4, 5, 2, 8, 13, 10, 5, 10, 13, 18, 25, 20, 17, 16, 9, 13, 18, 13, 10, 17, 20, 25, 32, 25, 20, 17, 10, 10, 13, 8, 9, 16, 17, 20, 25, 18, 13, 10, 5, 32, 41, 34, 25, 34, 41, 50, 61, 52, 45, 40, 29, 29, 40, 45, 20, 17, 26, 37, 50, 53, 58]