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.

A061393 Number of appearances of n in sequence defined by b(k) = b(floor(k/3)) + b(ceiling(k/3)) with b(0)=0 and b(1)=1, i.e., in A061392.

Table of values

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

List of values

[1, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 82, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 244, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 82, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 730, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 82, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2]

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

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