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.

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

Table of values

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

List of values

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