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.

A127397 a(0)=0; a(n) = smallest positive integer not occurring earlier in the sequence such that a(n-1)+a(n) = j^k, j = any positive integer, k = any integer >= 2.

Table of values

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

List of values

[0, 1, 3, 5, 4, 12, 13, 14, 2, 6, 10, 15, 17, 8, 19, 30, 34, 47, 53, 11, 16, 9, 7, 18, 31, 33, 48, 52, 29, 20, 44, 37, 27, 22, 42, 39, 25, 24, 40, 41, 23, 26, 38, 43, 21, 28, 36, 45, 55, 66, 59, 62, 63, 58, 67, 54, 46, 35, 65, 56, 69, 75, 50, 71, 57, 64, 61, 60, 68, 32, 49, 51, 70]