312984
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 1 (n >= 0, k >= 0).at n=48A120981
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (1, 1)}.at n=13A151389
- a(n) = n!*Sum_{i=1..n} (Sum_{j=1..i} (i/j)).at n=6A307642
- Least k such that p = k^2 + 1 and q = (k+2n)^2 + 1 are prime numbers with q - p square.at n=2A339007
- Least k such that p = k^2 + 1 and q = (k+2n)^2 + 1 are two consecutive prime numbers of the same form with q - p square.at n=2A339008
- Expansion of 1/(1 - 8*x + 4*x^2)^(5/2).at n=5A387343