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.

A224211 Irregular triangular array read by rows. T(n,k) is the number of n-permutations with exactly k distinct cycle lengths; n>=1, 1<=k<=floor( (-1+(1+8n)^(1/2))/2 ).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 6
6 8
7 24
8 50
9 120
10 234
11 120
12 720
13 1764
14 630
15 5040
16 11808
17 7392
18 40320
19 109584
20 69552
21 362880
22 954000
23 763200
24 151200
25 3628800
26 10628640
27 8165520
28 1330560
29 39916800
30 113891040
31 109010880
32 25280640
33 479001600
34 1486442880
35 1345687200
36 381775680
37 6227020800
38 18913184640
39 19773804960
40 6763236480
41 87178291200
42 283465647360
43 291950568000
44 102508005600
45 10897286400

List of values

[1, 1, 2, 3, 6, 8, 24, 50, 120, 234, 120, 720, 1764, 630, 5040, 11808, 7392, 40320, 109584, 69552, 362880, 954000, 763200, 151200, 3628800, 10628640, 8165520, 1330560, 39916800, 113891040, 109010880, 25280640, 479001600, 1486442880, 1345687200, 381775680, 6227020800, 18913184640, 19773804960, 6763236480, 87178291200, 283465647360, 291950568000, 102508005600, 10897286400]