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.

A229137 a(1) = a(2) = 1; if n == 0 (mod 3), then a(n) = a(n/3), otherwise a(n) = a(n-1) + a(n-2).

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 1
7 4
8 5
9 1
10 6
11 7
12 2
13 9
14 11
15 3
16 14
17 17
18 1
19 18
20 19
21 4
22 23
23 27
24 5
25 32
26 37
27 1
28 38
29 39
30 6
31 45
32 51
33 7
34 58
35 65
36 2
37 67
38 69
39 9
40 78
41 87
42 11
43 98
44 109
45 3
46 112
47 115
48 14
49 129
50 143
51 17
52 160
53 177
54 1
55 178
56 179
57 18
58 197
59 215
60 19
61 234
62 253
63 4
64 257
65 261
66 23
67 284

List of values

[1, 1, 1, 2, 3, 1, 4, 5, 1, 6, 7, 2, 9, 11, 3, 14, 17, 1, 18, 19, 4, 23, 27, 5, 32, 37, 1, 38, 39, 6, 45, 51, 7, 58, 65, 2, 67, 69, 9, 78, 87, 11, 98, 109, 3, 112, 115, 14, 129, 143, 17, 160, 177, 1, 178, 179, 18, 197, 215, 19, 234, 253, 4, 257, 261, 23, 284]

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

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