100891

Appears in sequences

• Number of times the n-th prime appears among the decimal digits of 2^(2^n) + 1, the Fermat numbers.at n=24A078671
• Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of Delannoy paths of length n, having k EE's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1).at n=21A110121