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.

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

Table of values

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

List of values

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