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.

A003056 n appears n+1 times. Also the array A(n,k) = n+k (n >= 0, k >= 0) read by antidiagonals. Also inverse of triangular numbers.

Table of values

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

List of values

[0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12]