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.

A227296 Number of partitions of n into parts <= phi(n), where phi is Euler's totient function (cf. A000010).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 6
6 4
7 14
8 15
9 26
10 23
11 55
12 34
13 100
14 90
15 146
16 186
17 296
18 199
19 489
20 434
21 725
22 807
23 1254
24 919
25 1946
26 2063
27 2943
28 3036
29 4564
30 2462
31 6841
32 7665
33 9871
34 11098
35 14744
36 12384
37 21636
38 23928
39 30677
40 31603
41 44582
42 31570
43 63260
44 69414
45 86420
46 99795
47 124753

List of values

[1, 1, 1, 2, 3, 6, 4, 14, 15, 26, 23, 55, 34, 100, 90, 146, 186, 296, 199, 489, 434, 725, 807, 1254, 919, 1946, 2063, 2943, 3036, 4564, 2462, 6841, 7665, 9871, 11098, 14744, 12384, 21636, 23928, 30677, 31603, 44582, 31570, 63260, 69414, 86420, 99795, 124753]