87602

Appears in sequences

• Triangle read by rows: T(n,k) is the number of paths in the first quadrant, from (0,0) to (n,0), consisting of steps U=[1,1], D[1,-1], h=(1,0) and H=(2,0), having height k (0<=k<=floor(n/2)).at n=51A132888
• a(n) = the n-bit number in which the i-th bit is 1 if and only if prime(i) divides A060795(n).at n=16A277428