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.

A132139 a(n) = f(n,1) with f(m,x) = if m<3 then (if m=1 then x else 0) else (if m mod 3 = 0 then 0 else f([m/3], x*(1 + m mod 3) + 1)).

Table of values

n a(n)
1 1
2 0
3 0
4 3
5 4
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 7
14 9
15 0
16 10
17 13
18 0
19 0
20 0
21 0
22 0
23 0
24 0
25 0
26 0
27 0
28 0
29 0
30 0
31 0
32 0
33 0
34 0
35 0
36 0
37 0
38 0
39 0
40 15
41 19
42 0
43 21
44 27
45 0
46 0
47 0
48 0
49 22
50 28
51 0
52 31
53 40
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 0
70 0
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 0
88 0
89 0
90 0
91 0
92 0
93 0
94 0
95 0
96 0
97 0
98 0
99 0
100 0

List of values

[1, 0, 0, 3, 4, 0, 0, 0, 0, 0, 0, 0, 7, 9, 0, 10, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 19, 0, 21, 27, 0, 0, 0, 0, 22, 28, 0, 31, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]