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.

A113722 A variant of Golomb's sequence using odd numbers: a(n) is the number of times 2*n+1 occurs, starting with a(1) = 1.

Table of values

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

List of values

[1, 3, 5, 5, 5, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 21, 21, 21, 21, 21, 21, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 25, 25, 25, 25, 27]

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

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