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.

A056043 Let k be largest number such that k^2 divides n!; a(n) = k/floor(n/2)!.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 2, 1, 3, 6, 6, 2, 2, 2, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 10, 10, 30, 30, 30, 12, 12, 3, 3, 6, 30, 10, 10, 10, 30, 6, 6, 2, 2, 2, 30, 60, 60, 30, 210, 42, 42, 42, 42, 28, 28, 2, 2, 4, 4, 4, 4, 4, 84, 21, 21, 14, 14, 14, 42, 6, 6, 2, 2, 2, 10, 10, 70, 140, 140, 14, 126, 126]

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

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