854992152
domain: N
Appears in sequences
- a(n) = binomial(n,11).at n=26A001288
- Binomial coefficient C(37,n).at n=11A010953
- Binomial coefficient C(n,26).at n=11A010979
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=4A104181
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=8A104181
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=14A104181
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=16A104181
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=19A104181
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=22A104181
- Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=27A104181
- a(n) = binomial(prime(n+5), prime(5)).at n=7A126998
- a(n) = Sum_{j=1..floor(n/2)} binomial(n+j-1,j-1).at n=24A175167
- a(n) = binomial(3n+1, n-1).at n=11A236194
- Terms at square positions in Pascal's triangle when in flattened form.at n=27A268295