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.

A075790 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 s.

Table of values

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

List of values

[2, 5, 1, 2, 2, 0, 1, 1, 4, 3, 4, 2, 6, 0, 1, 3, 2, 3, 2, 4, 2, 3, 2, 1, 10, 1, 3, 2, 14, 19, 1, 2, 4, 0, 1, 8, 3, 11, 5, 3, 2, 0, 21, 9, 2, 3, 9, 1, 2, 0, 7, 12, 26, 3, 3, 2, 8, 0, 29, 2, 8, 0, 1, 6, 4, 0, 33, 2, 10, 0, 5, 3, 2, 13, 5, 7, 2, 0, 7, 1, 12, 0, 41, 4, 6, 0, 13, 9, 2, 0, 3, 2, 2, 3, 7, 2, 2, 3]