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.

A137604 Consider the sequence: b(0) = n, and for k >= 1, b(k) = b(k-1)/2 if b(k-1) is even, otherwise b(k) = n - (b(k-1)+1)/2. Then a(n) = (Sum_{0<=k<=m} b(k)) - 1 for n > 1, where m is the smallest index such that b(m) = 1; a(1) = 1.

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 7
6 15
7 21
8 14
9 15
10 45
11 30
12 66
13 63
14 61
15 105
16 30
17 31
18 102
19 171
20 114
21 93
22 63
23 134
24 276
25 258
26 88
27 351
28 270
29 105
30 435
31 465
32 62
33 63
34 561
35 374
36 630
37 126
38 374
39 570
40 780
41 547
42 861
43 126
44 602
45 204
46 246
47 196
48 846
49 537
50 361
51 1275
52 1326
53 264
54 1431
55 483
56 990
57 315

List of values

[1, 2, 3, 6, 7, 15, 21, 14, 15, 45, 30, 66, 63, 61, 105, 30, 31, 102, 171, 114, 93, 63, 134, 276, 258, 88, 351, 270, 105, 435, 465, 62, 63, 561, 374, 630, 126, 374, 570, 780, 547, 861, 126, 602, 204, 246, 196, 846, 537, 361, 1275, 1326, 264, 1431, 483, 990, 315]