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.

A087429 a(n) = 1 if gpf(n) < gpf(n+1), otherwise 0, where gpf = A006530 (greatest prime factor).

Table of values

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

List of values

[1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1]