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.

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

List of values

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

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

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