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.

A319909 Number of distinct positive integers that can be obtained by iteratively adding any two or multiplying any two non-1 parts of an integer partition until only one part remains, starting with 1^n.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 2
6 4
7 5
8 10
9 15
10 21
11 34
12 49
13 68
14 101
15 142
16 197
17 280
18 387
19 538
20 751
21 1045
22 1442
23 2010
24 2772
25 3865
26 5339
27 7396
28 10273
29 14201
30 19693

List of values

[0, 1, 1, 1, 1, 2, 4, 5, 10, 15, 21, 34, 49, 68, 101, 142, 197, 280, 387, 538, 751, 1045, 1442, 2010, 2772, 3865, 5339, 7396, 10273, 14201, 19693]

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

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