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.

A330714 For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let h(n) = Sum_{k=0..w} b_k * i^k (where i denotes the imaginary unit); a(n) is the square of the modulus of h(n).

Table of values

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

List of values

[0, 1, 1, 2, 1, 0, 2, 1, 1, 2, 0, 1, 2, 1, 1, 0, 1, 4, 2, 5, 0, 1, 1, 2, 2, 5, 1, 4, 1, 2, 0, 1, 1, 2, 4, 5, 2, 1, 5, 4, 0, 1, 1, 2, 1, 0, 2, 1, 2, 5, 5, 8, 1, 2, 4, 5, 1, 4, 2, 5, 0, 1, 1, 2, 1, 0, 2, 1, 4, 1, 5, 2, 2, 1, 1, 0, 5, 2, 4, 1, 0, 1, 1, 2, 1]