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.

A096115 If n = (2^k)-1, a(n) = a((n+1)/2) = k, if n = 2^k, a(n) = a(n-1)+1 = k+1, otherwise a(n) = (A000523(n)+1)*a(A035327(n-1)).

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 6
6 6
7 3
8 4
9 12
10 24
11 24
12 12
13 8
14 8
15 4
16 5
17 20
18 40
19 40
20 60
21 120
22 120
23 60
24 20
25 15
26 30
27 30
28 15
29 10
30 10
31 5
32 6
33 30
34 60
35 60
36 90
37 180
38 180
39 90
40 120
41 360
42 720
43 720
44 360
45 240
46 240
47 120
48 30
49 24
50 48
51 48
52 72
53 144
54 144
55 72
56 24
57 18
58 36
59 36
60 18
61 12
62 12
63 6
64 7
65 42
66 84
67 84
68 126

List of values

[1, 2, 2, 3, 6, 6, 3, 4, 12, 24, 24, 12, 8, 8, 4, 5, 20, 40, 40, 60, 120, 120, 60, 20, 15, 30, 30, 15, 10, 10, 5, 6, 30, 60, 60, 90, 180, 180, 90, 120, 360, 720, 720, 360, 240, 240, 120, 30, 24, 48, 48, 72, 144, 144, 72, 24, 18, 36, 36, 18, 12, 12, 6, 7, 42, 84, 84, 126]

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

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