A371282 - cp's OEIS frontend

A371282 a(1)=1; for n>1, a(n) = a(n-1) * k or a(n-1) - k to give the smallest, distinct positive integer, where each k can be used only once.

n	a(n)
1	1
2	2
3	6
4	5
5	20
6	3
7	15
8	4
9	24
10	8
11	56
12	7
13	63
14	9
15	72
16	10
17	100
18	11
19	132
20	12
21	156
22	13
23	182
24	14
25	210
26	16
27	288
28	17
29	323
30	18
31	360
32	19
33	399
34	21
35	462
36	22
37	506
38	23
39	552
40	25
41	625
42	26
43	676
44	27
45	729
46	28
47	784
48	29
49	841
50	30
51	900
52	31
53	961
54	32
55	1024
56	33
57	1089
58	34
59	1156
60	35
61	1225

[1, 2, 6, 5, 20, 3, 15, 4, 24, 8, 56, 7, 63, 9, 72, 10, 100, 11, 132, 12, 156, 13, 182, 14, 210, 16, 288, 17, 323, 18, 360, 19, 399, 21, 462, 22, 506, 23, 552, 25, 625, 26, 676, 27, 729, 28, 784, 29, 841, 30, 900, 31, 961, 32, 1024, 33, 1089, 34, 1156, 35, 1225]

cp's OEIS Frontend

A371282 a(1)=1; for n>1, a(n) = a(n-1) * k or a(n-1) - k to give the smallest, distinct positive integer, where each k can be used only once.

Table of values

List of values