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.

A321021 a(0)=0, a(1)=1; thereafter a(n) = a(n-2)+a(n-1), keeping just the digits that appear exactly once.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 5
6 8
7 13
8 21
9 34
10 0
11 34
12 34
13 68
14 102
15 170
16 7
17 1
18 8
19 9
20 17
21 26
22 43
23 69
24 2
25 71
26 73
27 1
28 74
29 75
30 149
31 4
32 153
33 157
34 310
35 467
36 0
37 467
38 467
39 934
40 40
41 974
42 4
43 978
44 982
45 1960
46 94
47 2054
48 2148
49 40
50 21
51 61
52 82
53 143
54 5
55 148
56 153
57 301
58 5
59 306
60 3

List of values

[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 0, 34, 34, 68, 102, 170, 7, 1, 8, 9, 17, 26, 43, 69, 2, 71, 73, 1, 74, 75, 149, 4, 153, 157, 310, 467, 0, 467, 467, 934, 40, 974, 4, 978, 982, 1960, 94, 2054, 2148, 40, 21, 61, 82, 143, 5, 148, 153, 301, 5, 306, 3]