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.

A100387 a(n) is the largest number x such that for m=n to n+x-1, A006530(m) decreases.

Table of values

n a(n)
2 1
3 2
4 1
5 2
6 1
7 2
8 1
9 1
10 1
11 2
12 1
13 4
14 3
15 2
16 1
17 2
18 1
19 2
20 1
21 1
22 1
23 2
24 1
25 1
26 2
27 1
28 1
29 2
30 1
31 2
32 1
33 1
34 3
35 2
36 1
37 4
38 3
39 2
40 1
41 2
42 1
43 3
44 2
45 1
46 1
47 2
48 1
49 2
50 1
51 2
52 1
53 2
54 1
55 2
56 1
57 1
58 1
59 2
60 1
61 4
62 3
63 2
64 1
65 2
66 1
67 2
68 1
69 2
70 1
71 2
72 1
73 3
74 2
75 1
76 2
77 1
78 1
79 3
80 2
81 1
82 1
83 2
84 1
85 1
86 3
87 2
88 1
89 2
90 1
91 1
92 1
93 1
94 3
95 2
96 1
97 2
98 1
99 2
100 1
101 2
102 1
103 3
104 2
105 1

List of values

[1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 3, 2, 1, 4, 3, 2, 1, 2, 1, 3, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 1, 3, 2, 1, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1]