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.

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

List of values

[0, 1, 2, 1, 4, 5, 2, 1, 8, 13, 10, 13, 4, 9, 2, 5, 16, 9, 26, 17, 20, 13, 26, 17, 8, 5, 18, 13, 4, 1, 10, 5, 32, 41, 18, 25, 52, 61, 34, 41, 40, 53, 26, 37, 52, 65, 34, 45, 16, 17, 10, 9, 36, 37, 26, 25, 8, 13, 2, 5, 20, 25, 10, 13, 64, 65, 82, 81, 36, 37, 50]