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.

A048685 a(n) is the number of times the maximum value of Omega(binomial(n, k)) occurs in the n-th row of Pascal's triangle, where Omega(n) is the number of prime divisors of n counted with multiplicity (A001222).

Table of values

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

List of values

[2, 1, 2, 3, 2, 1, 4, 2, 6, 3, 4, 2, 2, 1, 2, 4, 4, 2, 8, 2, 2, 3, 8, 2, 2, 3, 2, 3, 2, 1, 2, 4, 2, 4, 8, 2, 2, 2, 12, 2, 6, 2, 2, 2, 2, 1, 2, 2, 2, 4, 8, 2, 4, 2, 4, 2, 2, 5, 4, 2, 4, 1, 18, 2, 8, 2, 2, 10, 8, 2, 2, 6, 2, 2, 2, 2, 4, 2, 10, 8, 4, 4, 2, 6, 2, 3, 2, 2, 4, 2, 2, 2, 2, 1, 2, 4, 4, 2, 4, 2, 4, 4]