144060

Appears in sequences

• Triangle of coefficients in expansion of (2 + 7*x)^n.at n=25A013623
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*2^j.at n=23A038268
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*12^j.at n=16A038278
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*7^j.at n=19A038333
• Least n such that nextprime(p*n) > p*nextprime(n) where p runs through the prime numbers (if p is prime then nextprime(p)=p).at n=33A117102
• Coordination sequence for 12-dimensional cyclotomic lattice Z[zeta_28].at n=5A126921
• a(n) = (n^3 - n)*7^n.at n=3A128965
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=13.at n=18A135198
• Triangle T(n, k) = ( (k+2)/(2*binomial(k+2, 2)^2) )*binomial(n, k)^2*binomial(n+1, k)*binomial(n+2, k), read by rows.at n=31A142470
• Triangle T(n, k) = ( (k+2)/(2*binomial(k+2, 2)^2) )*binomial(n, k)^2*binomial(n+1, k)*binomial(n+2, k), read by rows.at n=32A142470
• Records in A160256.at n=36A151545
• a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.at n=33A174741
• Triangle read by rows: Bell polynomial of the second kind B(n,k) with argument vector (7, 42, 210, 840, 2520, 5040, 5040).at n=13A188066
• Triangle read by rows: terms T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k).at n=25A244143
• Numbers whose prime factors counted with multiplicity satisfy: (maximum) - (minimum) = (mean).at n=39A362268