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.

A097564 a(n) = (a(n-1) mod 2)*a(n-1) + a(n-2) with a(0)=0, a(1)=1.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 1
5 3
6 4
7 3
8 7
9 10
10 7
11 17
12 24
13 17
14 41
15 58
16 41
17 99
18 140
19 99
20 239
21 338
22 239
23 577
24 816
25 577
26 1393
27 1970
28 1393
29 3363
30 4756
31 3363
32 8119
33 11482
34 8119
35 19601
36 27720
37 19601
38 47321
39 66922
40 47321
41 114243
42 161564
43 114243
44 275807
45 390050
46 275807
47 665857

List of values

[0, 1, 1, 2, 1, 3, 4, 3, 7, 10, 7, 17, 24, 17, 41, 58, 41, 99, 140, 99, 239, 338, 239, 577, 816, 577, 1393, 1970, 1393, 3363, 4756, 3363, 8119, 11482, 8119, 19601, 27720, 19601, 47321, 66922, 47321, 114243, 161564, 114243, 275807, 390050, 275807, 665857]