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.

A345290 a(n) is obtained by replacing 2^k in binary expansion of n with Fibonacci(-k-2).

Table of values

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

List of values

[0, -1, 2, 1, -3, -4, -1, -2, 5, 4, 7, 6, 2, 1, 4, 3, -8, -9, -6, -7, -11, -12, -9, -10, -3, -4, -1, -2, -6, -7, -4, -5, 13, 12, 15, 14, 10, 9, 12, 11, 18, 17, 20, 19, 15, 14, 17, 16, 5, 4, 7, 6, 2, 1, 4, 3, 10, 9, 12, 11, 7, 6, 9, 8, -21, -22, -19, -20, -24]

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

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