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.

A281944 Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with n colors such that exactly two balls are of a color seen previously in the sequence.

Table of values

n a(n)
1 1
2 2
3 14
4 3
5 42
6 150
7 4
8 84
9 600
10 1560
11 5
12 140
13 1500
14 7800
15 16800
16 6
17 210
18 3000
19 23400
20 100800
21 191520
22 7
23 294
24 5250
25 54600
26 352800
27 1340640
28 2328480
29 8
30 392
31 8400
32 109200
33 940800
34 5362560
35 18627840
36 30240000
37 9
38 504
39 12600
40 196560
41 2116800
42 16087680
43 83825280
44 272160000
45 419126400
46 10
47 630
48 18000
49 327600
50 4233600
51 40219200
52 279417600
53 1360800000
54 4191264000
55 6187104000

List of values

[1, 2, 14, 3, 42, 150, 4, 84, 600, 1560, 5, 140, 1500, 7800, 16800, 6, 210, 3000, 23400, 100800, 191520, 7, 294, 5250, 54600, 352800, 1340640, 2328480, 8, 392, 8400, 109200, 940800, 5362560, 18627840, 30240000, 9, 504, 12600, 196560, 2116800, 16087680, 83825280, 272160000, 419126400, 10, 630, 18000, 327600, 4233600, 40219200, 279417600, 1360800000, 4191264000, 6187104000]