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.

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

Table of values

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

List of values

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