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.

A230025 Triangular array: t(n, k) = number of occurrences of k as the number of outliers in all the partitions of n.

Table of values

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

List of values

[1, 0, 2, 1, 0, 2, 1, 2, 0, 2, 1, 2, 2, 0, 2, 1, 2, 4, 2, 0, 2, 1, 4, 2, 4, 2, 0, 2, 2, 2, 6, 2, 6, 2, 0, 2, 2, 6, 2, 8, 2, 6, 2, 0, 2, 2, 4, 12, 2, 8, 2, 8, 2, 0, 2, 2, 8, 6, 14, 2, 10, 2, 8, 2, 0, 2, 3, 6, 14, 8, 18, 2, 10, 2, 10, 2, 0, 2, 3, 10, 10, 20, 10]

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

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