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.

A227141 Array A(n,k) where A(1,k)=1 for row 1, and subsequent rows A(n > 1, k) are computed by recurrences related to Bulgarian Solitaire; square array A(n,k), with row n >= 1, column k >= 0, read by antidiagonals.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 4, 3, 2, 1, 1, 1, 1, 3, 3, 3, 2, 1, 1, 1, 2, 2, 5, 4, 3, 2, 1, 1, 1, 1, 3, 4, 4, 4, 3, 2, 1, 1, 1, 2, 4, 4, 6, 5, 4, 3, 2, 1, 1, 1, 1, 2, 3, 5, 5, 5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 7, 6, 5, 4, 3, 2, 1, 1]