59785
domain: N
Appears in sequences
- Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2) + sopf(n-3), where sopf(x) = sum of the distinct prime factors of x.at n=1A075784
- Fourth row of Pascal-(1,3,1) array A081578.at n=18A081586
- Triangle read by rows: T(n,k) is the number of permutations of [1..n] with k modular progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0).at n=46A216724
- a(n) = (4*n^3 - 6*n^2 + 14*n + 3)/3.at n=36A321124