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.

A359953 a(1) = 0, a(2) = 1. For n >= 3, if the greatest prime dividing n is greater than the greatest prime dividing n-1, then a(n) = a(n-1) + 1. Otherwise a(n) = a(n-1) - 1.

Table of values

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

List of values

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