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.

A252666 Let k be the smallest number such that s(k) = odd part of digital sum of 2^k is 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 5
4 4
5 7
6 8
7 47
8 12
9 42
10 19
11 20
12 24
13 23
14 28
15 31
16 76
17 35
18 34
19 38
20 39
21 48
22 52
23 116
24 63
25 0
26 140
27 68
28 81
29 66
30 89
31 96
32 198
33 97
34 92
35 415
36 94
37 0
38 229
39 119
40 121
41 539
42 132
43 133
44 146
45 292
46 162
47 158
48 148
49 651
50 164
51 153
52 167
53 196
54 165
55 757
56 205
57 201
58 0
59 184
60 175

List of values

[5, 4, 7, 8, 47, 12, 42, 19, 20, 24, 23, 28, 31, 76, 35, 34, 38, 39, 48, 52, 116, 63, 0, 140, 68, 81, 66, 89, 96, 198, 97, 92, 415, 94, 0, 229, 119, 121, 539, 132, 133, 146, 292, 162, 158, 148, 651, 164, 153, 167, 196, 165, 757, 205, 201, 0, 184, 175]