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.

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

Table of values

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

List of values

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