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.

A075791 If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of j.

Table of values

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

List of values

[3, 2, 2, 2, 2, 0, 2, 2, 2, 7, 2, 2, 2, 0, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 0, 2, 2, 3, 3, 2, 2, 3, 0, 2, 2, 2, 5, 2, 2, 5, 0, 2, 2, 2, 3, 2, 3, 2, 0, 2, 2, 2, 0, 2, 2, 2, 0, 2, 5, 2, 0, 3, 2, 3, 2, 2, 2, 2, 0, 2, 2, 2, 0, 2, 2, 2, 0, 2, 2, 5, 0, 2, 3, 5, 3, 2, 2, 7, 3, 2, 2, 3, 0, 2, 2, 2]