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.

A208884 a(n) = (a(n-1) + n)/2^k where 2^k is the largest power of 2 dividing a(n-1) + n, for n>1 with a(1)=1.

Table of values

n a(n)
1 1
2 3
3 3
4 7
5 3
6 9
7 1
8 9
9 9
10 19
11 15
12 27
13 5
14 19
15 17
16 33
17 25
18 43
19 31
20 51
21 9
22 31
23 27
24 51
25 19
26 45
27 9
28 37
29 33
30 63
31 47
32 79
33 7
34 41
35 19
36 55
37 23
38 61
39 25
40 65
41 53
42 95
43 69
44 113
45 79
46 125
47 43
48 91
49 35
50 85
51 17
52 69
53 61
54 115
55 85
56 141
57 99
58 157
59 27
60 87
61 37
62 99
63 81
64 145
65 105
66 171

List of values

[1, 3, 3, 7, 3, 9, 1, 9, 9, 19, 15, 27, 5, 19, 17, 33, 25, 43, 31, 51, 9, 31, 27, 51, 19, 45, 9, 37, 33, 63, 47, 79, 7, 41, 19, 55, 23, 61, 25, 65, 53, 95, 69, 113, 79, 125, 43, 91, 35, 85, 17, 69, 61, 115, 85, 141, 99, 157, 27, 87, 37, 99, 81, 145, 105, 171]

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

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