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.

A089399 a(n) satisfies: 2^a(n)+1 = sum(k=1,n, A089398(k)*2^(k-1)) for n>2, with a(1)=a(2)=0.

Table of values

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

List of values

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