A351328 - cp's OEIS frontend

A351328 a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate.

n	a(n)
1	0
2	1
3	2
4	3
5	6
6	720
7	5043
8	151
9	122
10	5
11	120
12	4
13	24
14	26
15	722
16	5044
17	169
18	363601
19	1454
20	7
21	5040
22	146
23	745
24	5184
25	40465
26	889
27	443520
28	177
29	10081
30	40324
31	57
32	5160
33	842
34	40346
35	775
36	10200
37	8
38	40320
39	34
40	30
41	9
42	362880
43	81369
44	403927
45	367953
46	368772
47	51128
48	40444
49	97
50	367920
51	368649
52	404670
53	5810
54	40442
55	75

[0, 1, 2, 3, 6, 720, 5043, 151, 122, 5, 120, 4, 24, 26, 722, 5044, 169, 363601, 1454, 7, 5040, 146, 745, 5184, 40465, 889, 443520, 177, 10081, 40324, 57, 5160, 842, 40346, 775, 10200, 8, 40320, 34, 30, 9, 362880, 81369, 403927, 367953, 368772, 51128, 40444, 97, 367920, 368649, 404670, 5810, 40442, 75]

cp's OEIS Frontend

A351328 a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate.

Table of values

List of values