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.

A267806 a(0) = a(1) = 1; for n>1, a(n) = (a(n-1) mod 2) + a(n-2).

Table of values

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

List of values

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

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

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