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.

A271315 Array T(n,k) read by diagonals: T(n,k) = T(n,k-1) + T(n,k-2) where T(n,0) = F(n+1), T(n,1) = F(n); F(n) = Fibonacci(n) = A000045(n).

Table of values

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

List of values

[1, 0, 1, 1, 1, 2, 1, 2, 1, 3, 2, 3, 3, 2, 5, 3, 5, 4, 5, 3, 8, 5, 8, 7, 7, 8, 5, 13, 8, 13, 11, 12, 11, 13, 8, 21, 13, 21, 18, 19, 19, 18, 21, 13, 34, 21, 34, 29, 31, 30, 31, 29, 34, 21, 55, 34, 55, 47, 50, 49, 49, 50, 47, 55, 34, 89]

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

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