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.

A325416 Least k such that the omega-sequence of k sums to n, and 0 if none exists.

Table of values

n a(n)
0 1
1 2
2 0
3 4
4 8
5 6
6 32
7 30
8 12
9 24
10 48
11 96
12 60
13 120
14 240
15 480
16 960
17 1920
18 3840
19 2520
20 5040
21 10080
22 20160
23 40320
24 80640

List of values

[1, 2, 0, 4, 8, 6, 32, 30, 12, 24, 48, 96, 60, 120, 240, 480, 960, 1920, 3840, 2520, 5040, 10080, 20160, 40320, 80640]