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.

A080217 a(n) is the number of distinct values taken by binomial(n,j) mod j for j in [1..n].

Table of values

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

List of values

[1, 2, 2, 2, 2, 4, 4, 4, 3, 4, 4, 7, 7, 6, 5, 7, 7, 7, 7, 9, 11, 12, 12, 12, 11, 11, 10, 11, 11, 12, 12, 12, 11, 12, 12, 13, 13, 13, 17, 18, 18, 15, 15, 18, 21, 17, 17, 19, 19, 18, 17, 16, 16, 20, 20, 23, 25, 23, 23, 26, 26, 24, 22, 24, 24, 27, 27, 27, 25, 28, 28, 30, 30, 32, 31, 30]

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

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