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.

A048299 Let b(n) = A048273(n) = maximal number of prime factors of C(n,k) for k=0..n; sequence gives smallest value of k achieving b(n).

Table of values

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

List of values

[0, 1, 1, 2, 2, 1, 2, 4, 3, 4, 4, 6, 6, 5, 4, 8, 8, 6, 6, 8, 8, 8, 8, 10, 5, 6, 12, 10, 10, 9, 10, 12, 12, 16, 15, 16, 16, 18, 18, 20, 20, 18, 18, 20, 16, 13, 16, 19, 20, 15, 20, 17, 18, 21, 24, 20, 21, 21, 21, 28, 29, 21, 21, 32, 32, 28, 29, 32, 32, 32, 28, 28, 29, 32, 32, 32, 35, 32]