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.

A026491 a(n) = least k > a(n-1) such that A001285(k-1) = A001285(n-1) for n >= 1.

Table of values

n a(n)
0 1
1 4
2 5
3 8
4 10
5 12
6 13
7 16
8 17
9 20
10 21
11 24
12 26
13 28
14 29
15 32
16 34
17 36
18 37
19 40
20 42
21 44
22 45
23 48
24 49
25 52
26 53
27 56
28 58
29 60
30 61
31 64
32 65
33 68
34 69
35 72
36 74
37 76
38 77
39 80
40 81
41 84
42 85
43 88
44 90
45 92
46 93
47 96
48 98
49 100
50 101
51 104
52 106
53 108
54 109
55 112
56 113
57 116
58 117

List of values

[1, 4, 5, 8, 10, 12, 13, 16, 17, 20, 21, 24, 26, 28, 29, 32, 34, 36, 37, 40, 42, 44, 45, 48, 49, 52, 53, 56, 58, 60, 61, 64, 65, 68, 69, 72, 74, 76, 77, 80, 81, 84, 85, 88, 90, 92, 93, 96, 98, 100, 101, 104, 106, 108, 109, 112, 113, 116, 117]