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.

A279033 Irregular triangular array: T(n,i) = number of strict partitions of n having crossover index k; see Comments.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 4
7 5
8 6
9 7
10 1
11 9
12 1
13 10
14 2
15 13
16 2
17 14
18 4
19 18
20 4
21 19
22 8
23 24
24 8
25 25
26 13
27 32
28 14
29 33
30 21
31 42
32 22
33 43
34 33
35 54
36 35
37 55
38 49
39 69
40 53
41 70
42 72
43 87
44 78
45 88
46 103
47 1
48 109
49 112
50 1
51 110
52 145
53 1
54 136
55 160
56 137
57 200
58 3
59 168
60 220
61 2
62 169
63 275
64 4
65 206
66 303
67 3

List of values

[1, 1, 2, 2, 3, 4, 5, 6, 7, 1, 9, 1, 10, 2, 13, 2, 14, 4, 18, 4, 19, 8, 24, 8, 25, 13, 32, 14, 33, 21, 42, 22, 43, 33, 54, 35, 55, 49, 69, 53, 70, 72, 87, 78, 88, 103, 1, 109, 112, 1, 110, 145, 1, 136, 160, 137, 200, 3, 168, 220, 2, 169, 275, 4, 206, 303, 3]

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

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