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.

A075788 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 r.

Table of values

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

List of values

[3, 3, 2, 2, 3, 0, 4, 4, 5, 13, 3, 4, 7, 0, 8, 5, 5, 3, 3, 6, 5, 7, 3, 2, 5, 35, 6, 2, 15, 83, 16, 6, 7, 0, 18, 10, 8, 37, 8, 7, 7, 0, 22, 5, 7, 17, 2, 8, 9, 0, 10, 14, 27, 9, 8, 8, 11, 0, 30, 8, 5, 0, 12, 10, 9, 0, 34, 10, 13, 0, 14, 9, 9, 3, 10, 5, 9, 0, 2, 12, 15, 0, 42, 10, 11, 0, 16, 13, 11, 0, 10]