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.

A343765 Lexicographically earliest sequence of distinct nonprime numbers such that for any n > 0, a(n+1) = a(n) XOR 2^k for some k >= 0 as small as possible (where XOR denotes the bitwise XOR operator).

Table of values

n a(n)
1 1
2 9
3 8
4 10
5 14
6 15
7 143
8 142
9 140
10 141
11 133
12 132
13 134
14 135
15 391
16 390
17 388
18 384
19 385
20 387
21 386
22 394
23 395
24 393
25 392
26 396
27 398
28 399
29 415
30 414
31 412
32 413
33 405
34 404
35 406
36 407
37 403
38 402
39 400
40 408
41 410
42 411
43 475
44 474
45 472
46 473
47 477
48 476
49 478
50 470
51 471
52 469
53 468
54 464

List of values

[1, 9, 8, 10, 14, 15, 143, 142, 140, 141, 133, 132, 134, 135, 391, 390, 388, 384, 385, 387, 386, 394, 395, 393, 392, 396, 398, 399, 415, 414, 412, 413, 405, 404, 406, 407, 403, 402, 400, 408, 410, 411, 475, 474, 472, 473, 477, 476, 478, 470, 471, 469, 468, 464]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.