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.

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

Table of values

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

List of values

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