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.

A235704 a(n) is the smallest number k such that n*k is a partition number.

Table of values

n a(n)
1 1
2 1
3 1
4 14
5 1
6 5
7 1
8 7
9 15
10 3
11 1
12 66
13 286
14 3
15 1
16 11
17 22715
18 44
19 33
20 35761
21 2
22 1
23 363
24 33
25 63
26 143
27 5
28 2
29 84
30 1
31 2425
32 72610
33 7
34 2725580
35 11
36 22
37 926026
38 3283
39 123981330
40 58088
41 363
42 1
43 70
44 4
45 3
46 176484
47 11209
48 85166
49 10
50 141790
51 11209835405

List of values

[1, 1, 1, 14, 1, 5, 1, 7, 15, 3, 1, 66, 286, 3, 1, 11, 22715, 44, 33, 35761, 2, 1, 363, 33, 63, 143, 5, 2, 84, 1, 2425, 72610, 7, 2725580, 11, 22, 926026, 3283, 123981330, 58088, 363, 1, 70, 4, 3, 176484, 11209, 85166, 10, 141790, 11209835405]