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.

A265249 Triangle read by rows: T(n,k) is the number of partitions of n having k parts strictly between the smallest and the largest part (n>=1, k>=0).

Table of values

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

List of values

[1, 2, 3, 5, 7, 10, 1, 13, 2, 17, 4, 1, 20, 8, 2, 26, 11, 4, 1, 29, 17, 8, 2, 35, 24, 13, 4, 1, 39, 33, 19, 8, 2, 48, 39, 30, 13, 4, 1, 48, 56, 41, 21, 8, 2, 60, 64, 57, 32, 13, 4, 1, 61, 83, 75, 47, 21, 8, 2, 74, 94, 100, 65, 34, 13, 4, 1]

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

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