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.

A347913 a(n) is the number of multisets of integers that are possible to reach by starting with n occurrences of 0 and by splitting. Splitting is taking 2 occurrences of the same integer and incrementing one of them by 1 and decrementing the other occurrence by 1.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 7
5 9
6 29
7 47
8 144
9 264
10 747
11 1531
12 4147
13 9063
14 23744
15 54522
16 140223
17 332033
18 845111
19 2045007
20 5176880
21 12713772
22 32115727
23 79676437
24 201227865
25 502852973

List of values

[1, 1, 2, 2, 7, 9, 29, 47, 144, 264, 747, 1531, 4147, 9063, 23744, 54522, 140223, 332033, 845111, 2045007, 5176880, 12713772, 32115727, 79676437, 201227865, 502852973]