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.

A278963 a(n) is the number of k, 1<=k<=n, such that gcd(n,k) divides binomial(n,k).

Table of values

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

List of values

[1, 1, 2, 3, 4, 2, 6, 6, 8, 6, 10, 7, 12, 6, 8, 14, 16, 14, 18, 12, 14, 14, 22, 12, 24, 18, 24, 18, 28, 11, 30, 28, 26, 30, 26, 28, 36, 30, 30, 27, 40, 20, 42, 30, 32, 30, 46, 32, 48, 42, 32, 38, 52, 36, 46, 43, 50, 42, 58, 32, 60, 30, 52, 60, 50, 48, 66, 60, 50]

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

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