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.

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

Table of values

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

List of values

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