32156

Appears in sequences

• Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=28A048131
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k low humps.at n=47A101281
• a(0) = 1; for n>0, a(n) = 2*(n+2)*4^(n-2)-(n/4)*((3-4*n)/(1-2*n))*binomial(2*n,n).at n=8A122122
• Limiting reverse row of the array A274193.at n=40A274200
• a(1) = 1; a(2) = 2; thereafter a(n) is the smallest number > a(n-1) which is neither of the form 2*a(i) nor Sum_{j=1..n-1} ( b_j*a(j) ) where 0 < i < n, b_j = 1 or 0.at n=18A331809