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.

A284282 a(n) = the number k such that A030067(2k-1) = n, or 0 if n does not occur in the semi-Fibonacci sequence A030067.

Table of values

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

List of values

[0, 1, 2, 3, 0, 4, 5, 0, 0, 6, 0, 7, 0, 0, 0, 0, 8, 9, 0, 0, 0, 0, 0, 10, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18]

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

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