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.

A319911 Number of distinct pairs (m, y), where m >= 1 and y is an integer partition of n with no 1's, such that m can be obtained by iteratively adding or multiplying together parts of y until only one part (equal to m) remains.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 3
6 7
7 9
8 21
9 31
10 65
11 102
12 194
13 321
14 575
15 956
16 1652
17 2684
18 4576
19 7367
20 12035
21 19490
22 31185
23 49418
24 78595
25 123393

List of values

[0, 1, 1, 2, 3, 7, 9, 21, 31, 65, 102, 194, 321, 575, 956, 1652, 2684, 4576, 7367, 12035, 19490, 31185, 49418, 78595, 123393]

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

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