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.

A080216 a(n) is the largest value taken by binomial(n,j) mod j for j in [1..n].

Table of values

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

List of values

[0, 1, 1, 1, 1, 3, 3, 4, 2, 5, 5, 7, 7, 7, 11, 8, 8, 9, 9, 13, 16, 11, 11, 15, 15, 13, 21, 18, 18, 18, 18, 18, 26, 26, 21, 25, 25, 21, 31, 28, 28, 29, 29, 31, 39, 27, 27, 36, 34, 31, 41, 34, 34, 45, 45, 36, 46, 46, 46, 43, 43, 41, 51, 40, 48, 52, 52, 52, 56, 44, 44, 52, 52, 57, 61]

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

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