19415

Appears in sequences

• Number of partitions of n into parts of 10 kinds.at n=6A023009
• a(0)=1, a(n) = M(n) + Sum_{k=1..n-1} M(k)*a(n-k-1), where M(n) are the Motzkin numbers (A001006).at n=11A045994
• Partial sums of squares of Catalan numbers (A000108).at n=6A094639
• G.f.: A(x) = exp( Sum_{n>=1} A056045(n)/n*x^n ), where A056045(n) = Sum_{d|n} binomial(n,d).at n=19A110448
• Numbers k such that (RSA-768) + 10^k is prime where RSA-768 is the 232 decimal digit RSA challenge number A391940(21).at n=12A113928
• Nonprimes in the triangle A141020.at n=28A141031
• Number of dispersed Dyck paths of length n having no ascents of length 1.at n=23A191385
• Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X 2 array.at n=9A219572
• a(0) = 1, a(n) + a(n+1) = round(2^n/9), n >= 0.at n=19A348405