62770

Appears in sequences

• Numbers n such that S(n) = 0, where S(n) = (S(n-1) + A000040(n+1))*(-1)^n; S(0)=0, n >= 1.at n=28A131693
• Number of Dyck paths of semilength n avoiding the pattern U^4 D^4 U D.at n=32A225691
• a(n) = Sum_{i=0..n} digsum_8(i)^4, where digsum_8(i) = A053829(i).at n=36A231683
• Number T(n,k) of reduced decompositions for all permutations of [n] with exactly k inversions; triangle T(n,k), n>=0, 0<=k<=n*(n-1)/2, read by rows.at n=50A289778
• Numbers k whose decimal representation can be split in three parts which can be used as seeds for a tribonacci-like sequence containing k itself.at n=38A383230