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.

A350127 a(n) = a(a(n-1)) mod 3 + a(n-2) with a(0) = 0 and a(1) = 1.

Table of values

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

List of values

[0, 1, 1, 2, 2, 3, 4, 5, 4, 7, 6, 8, 7, 10, 7, 12, 8, 13, 9, 14, 10, 14, 11, 16, 13, 17, 14, 18, 14, 19, 16, 21, 18, 21, 20, 22, 22, 24, 23, 25, 25, 27, 25, 29, 26, 31, 26, 33, 26, 35, 27, 35, 28, 37, 28, 39, 29, 40, 30, 41, 30, 42, 31, 42, 32, 42, 33, 42, 34]

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

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