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.

A359416 Write n as 2^m - k, where 2^m is the least power of 2 >= n (0 <= k <= 2^(m-1)-1). For n a power of 2 (k = 0), a(n) = n. For numbers with k > 0, a(n) is the least p*a(k) which has not occurred previously, the count of k being taken from right to left (backwards) from k = 1 at 2^m - 1.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 9
6 6
7 5
8 8
9 25
10 18
11 27
12 12
13 15
14 10
15 7
16 16
17 49
18 50
19 105
20 36
21 81
22 54
23 75
24 24
25 35
26 30
27 45
28 20
29 21
30 14
31 11
32 32
33 121
34 98
35 231
36 100
37 495
38 210
39 175
40 72
41 225
42 162
43 243
44 108
45 315
46 150
47 147
48 48
49 77
50 70
51 165
52 60
53 135
54 90
55 125
56 40
57 55
58 42
59 63
60 28
61 33
62 22
63 13
64 64

List of values

[1, 2, 3, 4, 9, 6, 5, 8, 25, 18, 27, 12, 15, 10, 7, 16, 49, 50, 105, 36, 81, 54, 75, 24, 35, 30, 45, 20, 21, 14, 11, 32, 121, 98, 231, 100, 495, 210, 175, 72, 225, 162, 243, 108, 315, 150, 147, 48, 77, 70, 165, 60, 135, 90, 125, 40, 55, 42, 63, 28, 33, 22, 13, 64]