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.

A378397 Rectangular array read by descending antidiagonals: (row 1) = u, and for n >= 2, (row n) = u-inverse runlength sequence of u, where u = A003842 (an infinite Fibonacci word). See Comments.

Table of values

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

List of values

[1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1]

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

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