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.

A340780 Losing positions n (P-positions) in the following game: two players take turns dividing the current value of n by either a prime power > 1 or by A007947(n) to obtain the new value of n. The winner is the player whose division results in 1.

Table of values

n a(n)
1 1
2 12
3 18
4 20
5 28
6 44
7 45
8 50
9 52
10 63
11 68
12 75
13 76
14 92
15 98
16 99
17 116
18 117
19 120
20 124
21 147
22 148
23 153
24 164
25 168
26 171
27 172
28 175
29 188
30 207
31 212
32 216
33 236
34 242
35 244
36 245
37 261
38 264
39 268
40 270
41 275
42 279
43 280
44 284
45 292
46 312
47 316
48 325
49 332
50 333
51 338
52 356
53 363
54 369
55 378
56 387
57 388

List of values

[1, 12, 18, 20, 28, 44, 45, 50, 52, 63, 68, 75, 76, 92, 98, 99, 116, 117, 120, 124, 147, 148, 153, 164, 168, 171, 172, 175, 188, 207, 212, 216, 236, 242, 244, 245, 261, 264, 268, 270, 275, 279, 280, 284, 292, 312, 316, 325, 332, 333, 338, 356, 363, 369, 378, 387, 388]