33903

Appears in sequences

• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k UHD's, where U=(1,1),H=(1,0),D=(1,-1) (0<=k<=floor(n/3)).at n=47A114583
• Numbers k such that k and k^2 use only the digits 0, 1, 3, 4 and 9.at n=16A136841
• Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having width k (n>=2, k>=1).at n=86A271942
• a(1) = 1; a(n) = a(n-1) + Sum_{k=2..n} a(floor(n/k)).at n=49A351620