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.

A140130 a(n) = denominator(c(n)) where c(n) = 1 if n=1, otherwise if n < 3*2^floor(log_2(n)-1) then c(n) = (c(floor(n/2))+c(floor((n+1)/2)))/2 otherwise c(n) = c(n-2^floor(log_2(n)))+1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 1
9 4
10 2
11 4
12 1
13 2
14 1
15 1
16 1
17 8
18 4
19 8
20 2
21 8
22 4
23 8
24 1
25 4
26 2
27 4
28 1
29 2
30 1
31 1
32 1
33 16
34 8
35 16
36 4
37 16
38 8
39 16
40 2
41 16
42 8
43 16
44 4
45 16
46 8
47 16
48 1
49 8
50 4
51 8
52 2
53 8
54 4
55 8
56 1
57 4
58 2
59 4
60 1
61 2
62 1
63 1
64 1
65 32
66 16
67 32
68 8
69 32
70 16
71 32
72 4
73 32
74 16
75 32
76 8
77 32
78 16
79 32
80 2
81 32
82 16
83 32
84 8
85 32
86 16
87 32
88 4
89 32
90 16

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 4, 2, 4, 1, 2, 1, 1, 1, 8, 4, 8, 2, 8, 4, 8, 1, 4, 2, 4, 1, 2, 1, 1, 1, 16, 8, 16, 4, 16, 8, 16, 2, 16, 8, 16, 4, 16, 8, 16, 1, 8, 4, 8, 2, 8, 4, 8, 1, 4, 2, 4, 1, 2, 1, 1, 1, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16, 32, 8, 32, 16, 32, 2, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16]