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.

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

Table of values

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

List of values

[0, 1, 1, 2, 4, 1, 5, 2, 4, 5, 1, 2, 8, 5, 5, 2, 16, 25, 17, 26, 4, 9, 5, 10, 20, 29, 17, 26, 8, 13, 5, 10, 16, 17, 25, 26, 20, 17, 29, 26, 4, 5, 9, 10, 8, 5, 13, 10, 32, 41, 41, 50, 20, 25, 29, 34, 20, 29, 25, 34, 8, 13, 13, 18, 64, 49, 65, 50, 100, 81, 101]