A279732 - cp's OEIS frontend

A279732 Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in factorial base.

n	a(n)
1	1
2	2
3	6
4	8
5	24
6	30
7	48
8	120
9	240
10	720
11	840
12	1440
13	1560
14	5040
15	10080
16	15120
17	40320
18	45360
19	80640
20	120960
21	362880
22	403200
23	725760
24	1088640
25	3628800
26	3991680
27	7257600
28	7620480
29	10886400
30	39916800
31	43545600
32	79833600
33	119750400
34	159667200
35	479001600
36	958003200

[1, 2, 6, 8, 24, 30, 48, 120, 240, 720, 840, 1440, 1560, 5040, 10080, 15120, 40320, 45360, 80640, 120960, 362880, 403200, 725760, 1088640, 3628800, 3991680, 7257600, 7620480, 10886400, 39916800, 43545600, 79833600, 119750400, 159667200, 479001600, 958003200]

cp's OEIS Frontend

A279732 Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in factorial base.

Table of values

List of values