363601

Appears in sequences

• Finite sequence of numbers n such that iterations for the map r -> A061602(r) starting with n ends with the same number n.at n=10A188284
• Let f map k to the sum of the factorials of the digits of k (A061602); sequence lists numbers such that f(f(f(k)))=k.at n=6A306955
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=14A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=17A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=20A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=23A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=26A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=29A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=32A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=35A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=38A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=41A308259
• a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.at n=44A308259
• 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.at n=17A351328