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.

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

Table of values

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

List of values

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