191251

Properties

Appears in sequences

• Primes that remain prime through 5 iterations of function f(x) = 2x + 9.at n=14A023334
• This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,4). The p-th row (p>=1) contains a(i,p) for i=1 to 4*p-3, where a(i,p) satisfies Sum_{i=1..n} C(i+3,4)^p = 5 * C(n+4,5) * Sum_{i=1..4*p-3} a(i,p) * C(n-1,i-1)/(i+4).at n=19A087108
• Sum_{k = 0..n} C(n, k)^2*C(n+k, n)*C(n+2*k, n).at n=4A098274
• Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 5.at n=16A244706
• Prime numbersat n=17267