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.

A351293 Number of non-Look-and-Say partitions of n. Number of integer partitions of n such that there is no way to choose a disjoint strict integer partition of each multiplicity.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 2
6 4
7 5
8 9
9 14
10 21
11 28
12 44
13 56
14 80
15 111
16 148
17 192
18 264
19 335
20 447
21 575
22 743
23 937
24 1213
25 1513
26 1924
27 2396
28 3011
29 3715
30 4646
31 5687
32 7040
33 8600
34 10556
35 12804
36 15650
37 18897
38 22930
39 27593
40 33296
41 39884
42 47921
43 57168
44 68360
45 81295
46 96807
47 114685

List of values

[0, 0, 0, 1, 1, 2, 4, 5, 9, 14, 21, 28, 44, 56, 80, 111, 148, 192, 264, 335, 447, 575, 743, 937, 1213, 1513, 1924, 2396, 3011, 3715, 4646, 5687, 7040, 8600, 10556, 12804, 15650, 18897, 22930, 27593, 33296, 39884, 47921, 57168, 68360, 81295, 96807, 114685]