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.

A078412 a(0) = 5, a(1) = 8; for n >1, a(n)=(a(n-1)+a(n-2))/3^n, where 3^n is the highest power of 3 dividing a(n-1)+a(n-2).

Table of values

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

List of values

[5, 8, 13, 7, 20, 1, 7, 8, 5, 13, 2, 5, 7, 4, 11, 5, 16, 7, 23, 10, 11, 7, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2]