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.

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

Table of values

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

List of values

[1, 1, 2, 3, 2, 5, 4, 6, 4, 7, 5, 9, 5, 11, 7, 12, 7, 13, 8, 15, 8, 17, 10, 18, 10, 19, 11, 21, 11, 23, 13, 24, 13, 25, 14, 27, 14, 29, 16, 30, 16, 31, 17, 33, 17, 35, 19, 36, 19, 37, 20, 39, 20, 41, 22, 42, 22, 43, 23, 45, 23, 47, 25, 48, 25, 49, 26, 51, 26, 53, 28]

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

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