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.

A174234 A variant of Landau's function (A000793) with a restriction on the length of cycles. a(n) is the largest value of lcm(p_1, ..., p_k), with p_1 + ... + p_k <= n, such that there exist integer offsets f_1, ..., f_k with 0 <= f_i < p_i, for which f_i and f_j are different modulo gcd(p_i, p_j).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 12
11 12
12 12
13 13
14 24
15 24
16 30
17 30
18 40
19 40
20 42
21 42
22 60
23 60
24 70
25 70
26 84
27 84
28 90
29 90
30 120
31 120
32 126
33 126
34 168
35 168
36 180
37 180
38 240
39 240
40 240
41 240
42 336
43 336
44 336
45 336
46 420
47 420
48 420
49 420
50 560
51 560
52 560
53 560
54 720
55 720
56 720
57 720
58 880
59 880
60 880

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 12, 12, 13, 24, 24, 30, 30, 40, 40, 42, 42, 60, 60, 70, 70, 84, 84, 90, 90, 120, 120, 126, 126, 168, 168, 180, 180, 240, 240, 240, 240, 336, 336, 336, 336, 420, 420, 420, 420, 560, 560, 560, 560, 720, 720, 720, 720, 880, 880, 880]

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

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