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.

A074724 Highest power of 3 dividing F(4n) where F(k) is the k-th Fibonacci number.

Table of values

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

List of values

[3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 81, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 81, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 243, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3]