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.

A335392 a(n) is the number of ways to reach n by the process of starting from 1 and repeatedly adding 5 or multiplying by 3.

Table of values

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

List of values

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