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.

A137998 Least k such that floor(16^n / 10^k) = 1, 2, 4 or 8 (mod 10), or zero if no such k exists.

Table of values

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

List of values

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