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.

A370731 a(n) is the least k >= 0 such that F(k) AND n = n (where F(k) denotes A000045(k), the k-th Fibonacci number and AND denotes the bitwise AND operator).

Table of values

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

List of values

[0, 1, 3, 4, 5, 5, 10, 10, 6, 7, 16, 16, 7, 7, 22, 22, 8, 8, 10, 10, 8, 8, 10, 10, 11, 11, 16, 16, 17, 17, 46, 46, 9, 10, 9, 10, 10, 10, 10, 10, 13, 13, 22, 22, 17, 17, 22, 22, 10, 10, 10, 10, 10, 10, 10, 10, 14, 14, 64, 64, 17, 17, 94, 94, 11, 11, 15, 16, 19]

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

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