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.

A144544 Unique sequence of digits a(0), a(1), a(2), .. such that for all k >= 2, the number A(k) := Sum_{n = 0..k-1 } a(n)*10^n satisfies 16^A(k) == A(k) mod 10^k.

Table of values

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

List of values

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