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.

A382559 a(n) is the length of the longest subsequence at indices in arithmetic progression ending at a(n-1) whose terms form an arithmetic progression in some order; a(1)=1.

Table of values

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

List of values

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