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.

A235963 n appears (n+1)/(1 + (n mod 2)) times.

Table of values

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

List of values

[0, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13]

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

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