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.

A068568 Let S = a subset of {n,n+1,n+2,..,n+m}, number of parts of S is more than 1. a(n) = smallest number m such that the product of parts of S is a square.

Table of values

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

List of values

[1, 3, 4, 5, 5, 5, 6, 7, 7, 7, 8, 9, 8, 8, 7, 9, 9, 10, 9, 9, 8, 7, 10, 9, 8, 10, 9, 8, 12, 13, 12, 13, 12, 11, 14, 13, 13, 13, 12, 11, 10, 13, 12, 11, 10, 9, 8, 7, 6, 14, 13, 14, 13, 13, 12, 11, 16, 18, 17, 16, 15, 16, 15, 14, 14, 13, 14, 17, 16, 15, 14, 17, 16, 17, 16, 15, 15, 14]