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.

A057944 Largest triangular number less than or equal to n; write m-th triangular number m+1 times.

Table of values

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

List of values

[0, 1, 1, 3, 3, 3, 6, 6, 6, 6, 10, 10, 10, 10, 10, 15, 15, 15, 15, 15, 15, 21, 21, 21, 21, 21, 21, 21, 28, 28, 28, 28, 28, 28, 28, 28, 36, 36, 36, 36, 36, 36, 36, 36, 36, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 66, 66, 66, 66, 66, 66]

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

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