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.

A096111 If n = 2^k - 1, then a(n) = k+1, otherwise a(n) = (A000523(n)+1)*a(A053645(n)).

Table of values

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

List of values

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

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

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