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.

A133614 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 4^A(k) == A(k) (mod 10^k).

Table of values

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

List of values

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