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.

A067148 Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0 with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 2, 2, 2, 1, 3, 1, 3, 2, 2, 1, 3, 2, 2, 2, 3, 1, 4, 1, 2, 2, 2, 2, 4, 1, 2, 2, 3, 2, 3, 1, 3, 3, 2, 1, 3, 1, 3, 2, 3, 1, 4, 2, 2, 2, 2, 1, 5, 1, 3, 2, 2, 2, 3, 2, 3, 2, 3, 1, 3, 1, 2, 3, 3, 1, 3, 1, 4, 2, 2, 2, 4, 2, 2, 2, 2, 1, 4, 1, 3, 3, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 3, 1, 4, 1, 3, 2, 2]