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.

A096116 a(1)=1, if n=(2^k)+1, a(n) = k+2, otherwise a(n) = 2+A000523(n-1)+a(2+A035327(n-1)).

Table of values

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

List of values

[1, 2, 3, 5, 4, 9, 7, 6, 5, 11, 12, 14, 9, 10, 8, 7, 6, 13, 14, 16, 15, 20, 18, 17, 11, 12, 13, 15, 10, 11, 9, 8, 7, 15, 16, 18, 17, 22, 20, 19, 18, 24, 25, 27, 22, 23, 21, 20, 13, 14, 15, 17, 16, 21, 19, 18, 12, 13, 14, 16, 11, 12, 10, 9, 8, 17, 18, 20, 19, 24, 22, 21, 20, 26]

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

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