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.

A252668 Let k be the smallest number such that s(k) = odd part of digital sum of 5^k is a multiple of prime(n); then a(n)=k, if s(k) = prime(n). Otherwise, or if there is no such k, a(n)=0.

Table of values

n a(n)
3 1
4 2
5 5
6 4
7 14
8 6
9 7
10 16
11 21
12 23
13 24
14 0
15 0
16 32
17 19
18 20
19 22
20 186
21 177
22 26
23 29
24 27
25 61
26 236
27 34
28 0
29 36
30 78
31 54
32 0
33 41
34 87
35 43
36 44
37 188
38 0
39 55
40 118
41 229
42 66
43 59
44 70
45 69
46 60
47 58
48 0
49 279
50 147
51 81
52 610
53 74
54 325
55 85
56 101
57 75
58 179
59 0
60 369
61 100
62 97
63 0
64 91
65 193
66 95
67 205

List of values

[1, 2, 5, 4, 14, 6, 7, 16, 21, 23, 24, 0, 0, 32, 19, 20, 22, 186, 177, 26, 29, 27, 61, 236, 34, 0, 36, 78, 54, 0, 41, 87, 43, 44, 188, 0, 55, 118, 229, 66, 59, 70, 69, 60, 58, 0, 279, 147, 81, 610, 74, 325, 85, 101, 75, 179, 0, 369, 100, 97, 0, 91, 193, 95, 205]