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.

A061986 Number of times n appears in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984.

Table of values

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

List of values

[1, 1, 1, 1, 2, 0, 2, 1, 3, 0, 0, 4, 2, 0, 0, 6, 0, 0, 0, 3, 5, 4, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 6, 0, 0, 0, 10, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 15, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0]