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.

A330617 Triangle read by rows: T(n,k) is the number of paths from node 0 to k in a directed graph with n+1 vertices labeled 0, 1, ..., n and edges leading from i to i+1 for all i, and from i to i+2 for even i and from i to i-2 for odd i.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 4, 1, 3, 2, 4, 4, 4, 1, 3, 2, 4, 4, 4, 8, 1, 4, 2, 6, 4, 8, 8, 8, 1, 4, 2, 6, 4, 8, 8, 8, 16, 1, 5, 2, 8, 4, 12, 8, 16, 16, 16, 1, 5, 2, 8, 4, 12, 8, 16, 16, 16, 32, 1, 6, 2, 10, 4, 16, 8, 24, 16, 32, 32, 32, 1, 6, 2, 10, 4, 16, 8, 24, 16, 32, 32, 32, 64]