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.

A026145 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026142. Also a(n) = 2*t(n) for n >= 2, where t = A026144.

Table of values

n a(n)
1 1
2 4
3 8
4 12
5 14
6 20
7 24
8 26
9 32
10 36
11 38
12 42
13 44
14 50
15 56
16 60
17 62
18 68
19 72
20 74
21 78
22 80
23 86
24 92
25 96
26 98
27 104
28 108
29 110
30 114
31 116
32 122
33 126
34 128
35 132
36 134
37 140
38 146
39 150
40 152
41 158
42 164
43 168
44 170
45 176
46 180
47 182
48 186
49 188
50 194
51 200
52 204
53 206
54 212
55 216
56 218
57 222

List of values

[1, 4, 8, 12, 14, 20, 24, 26, 32, 36, 38, 42, 44, 50, 56, 60, 62, 68, 72, 74, 78, 80, 86, 92, 96, 98, 104, 108, 110, 114, 116, 122, 126, 128, 132, 134, 140, 146, 150, 152, 158, 164, 168, 170, 176, 180, 182, 186, 188, 194, 200, 204, 206, 212, 216, 218, 222]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.