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.

A133613 Decimal digits such that for all k >= 1, the number A(k) := Sum_{n = 0..k-1} a(n)*10^n satisfies the congruence 3^A(k) == A(k) (mod 10^k).

Table of values

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

List of values

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