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.

A221947 Smallest number k (different from a power of 2) such that A006577(n*k) = A006577(n) + A006577(k), or 0 if no such number exists.

Table of values

n a(n)
1 3
2 3
3 423
4 3
5 81
6 423
7 75
8 3
9 0
10 81
11 11003
12 423
13 155
14 75
15 35
16 3
17 239
18 0
19 151
20 81
21 23
22 11003
23 21
24 423
25 21
26 155
27 341
28 75
29 201
30 35
31 75
32 3
33 21
34 239
35 15
36 0
37 113
38 151
39 21
40 81
41 635
42 23
43 1131
44 11003
45 2017
46 21
47 75
48 423
49 1267
50 21
51 75
52 155
53 253
54 341
55 151
56 75
57 7931
58 201
59 75
60 35
61 69
62 75
63 213
64 3
65 1073
66 21
67 423
68 239
69 61
70 15

List of values

[3, 3, 423, 3, 81, 423, 75, 3, 0, 81, 11003, 423, 155, 75, 35, 3, 239, 0, 151, 81, 23, 11003, 21, 423, 21, 155, 341, 75, 201, 35, 75, 3, 21, 239, 15, 0, 113, 151, 21, 81, 635, 23, 1131, 11003, 2017, 21, 75, 423, 1267, 21, 75, 155, 253, 341, 151, 75, 7931, 201, 75, 35, 69, 75, 213, 3, 1073, 21, 423, 239, 61, 15]