69765
domain: N
Appears in sequences
- Becomes prime or 4 after exactly 10 iterations of f(x) = sum of prime factors of x.at n=8A048132
- Triangle read by rows where T(n,k) is the number of factorizations of (n+1)! into k distinct factors.at n=62A157836
- Triangle read by rows, T(n, k) = S(k, n) with S(n, n) = 1, S(0, n) = 0 and otherwise S(k,n) = Sum_{i=1..n-k+1} k^i*S(k-1, n-i), for n>=0 and 0<=k<=n.at n=41A269955
- Number of nonnegative solutions of a certain system of linear Diophantine equations depending on an even parameter.at n=8A277387