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.

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

Table of values

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

List of values

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