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.

A261981 Number T(n,k) of compositions of n such that k is the minimal distance between two identical parts; triangle T(n,k), n>=2, 1<=k<=floor((sqrt(8*n-7)-1)/2), read by rows.

Table of values

n a(n)
2 1
3 1
4 4
5 1
6 9
7 2
8 18
9 3
10 41
11 8
12 2
13 89
14 16
15 4
16 185
17 34
18 10
19 388
20 57
21 10
22 810
23 113
24 30
25 6
26 1670
27 213
28 52
29 12
30 3435
31 396
32 104
33 28
34 7040
35 733
36 176
37 50
38 14360
39 1333
40 278
41 62
42 29226
43 2419
44 512
45 152
46 24
47 59347
48 4400
49 878
50 246
51 48
52 120229
53 7934
54 1492
55 458
56 108

List of values

[1, 1, 4, 1, 9, 2, 18, 3, 41, 8, 2, 89, 16, 4, 185, 34, 10, 388, 57, 10, 810, 113, 30, 6, 1670, 213, 52, 12, 3435, 396, 104, 28, 7040, 733, 176, 50, 14360, 1333, 278, 62, 29226, 2419, 512, 152, 24, 59347, 4400, 878, 246, 48, 120229, 7934, 1492, 458, 108]