A217490 - cp's OEIS frontend

A217490 Let t be the length of the shortest computation yielding a positive multiple of n! using addition, subtraction and multiplication. Then a(n) is the least k > 0 such that k*n! can be computed in t steps.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	13
8	26
9	11830
10	1183
11	1
12	561
13	48048
14	3432
15	3718
16	3718
17	956689100690500088178176
18	187
19	8983799529705
20	6061484504517072231744
21	26002249020
22	1181920410
23	8006931102170352452004696490160949546032818169320135140000

[1, 1, 1, 1, 2, 1, 13, 26, 11830, 1183, 1, 561, 48048, 3432, 3718, 3718, 956689100690500088178176, 187, 8983799529705, 6061484504517072231744, 26002249020, 1181920410, 8006931102170352452004696490160949546032818169320135140000]

cp's OEIS Frontend

A217490 Let t be the length of the shortest computation yielding a positive multiple of n! using addition, subtraction and multiplication. Then a(n) is the least k > 0 such that k*n! can be computed in t steps.

Table of values

List of values