435897

Appears in sequences

• Binomial coefficients C(n,5).at n=37A000389
• Binomial coefficients C(2*n+5,5).at n=16A002299
• Binomial coefficient C(37,n).at n=5A010953
• Binomial coefficient C(n,32).at n=5A010985
• T(n,5), array T as in A050186; a count of aperiodic binary words.at n=32A050190
• a(n) = binomial(n,floor(n/7)).at n=37A062947
• First differences of A048093.at n=36A084919
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=2A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=6A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=9A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=12A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=15A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=23A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=25A104181
• Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 2, n-k) for n>=k>=0.at n=15A126454
• Column 0 of triangle A126454; a(n) = C( C(n+2,3) + 2, n).at n=5A126455
• a(n) = binomial(prime(3+n), prime(3)).at n=9A126996
• a(n) = binomial(2^n + n, n).at n=5A132683
• a(n) = binomial(n, 2^floor(log_2(n))).at n=36A291665
• Number of ways to choose a multiset of n divisors of n.at n=31A343935