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.

A340862 Number of times the number n turns up in pseudo-Fibonacci sequences starting with [k, 1] (with k >= 1), excluding the starting terms.

Table of values

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

List of values

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