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.

A318439 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 imaginary part of h(n).

Table of values

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

List of values

[0, 0, 1, 1, -2, -2, -1, -1, 2, 2, 3, 3, 0, 0, 1, 1, 0, 0, 1, 1, -2, -2, -1, -1, 2, 2, 3, 3, 0, 0, 1, 1, -4, -4, -3, -3, -6, -6, -5, -5, -2, -2, -1, -1, -4, -4, -3, -3, -4, -4, -3, -3, -6, -6, -5, -5, -2, -2, -1, -1, -4, -4, -3, -3, 8, 8, 9, 9, 6, 6, 7, 7, 10]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.