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.

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

Table of values

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

List of values

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