65208

Appears in sequences

• Triangle read by rows: number of P-graphs by number of edges and number of non-root nodes.at n=47A011268
• Partial sums of A051946.at n=10A050484
• Maximum value in the distribution by first value of Prufer code of noncrossing spanning trees on a circle of n+2 points; perhaps the number whose Prufer code starts with 2.at n=7A056096
• Numbers k such that k*2^(k/2) + 1 is prime.at n=12A058767
• Successive maxima in sequence A007365.at n=21A065933
• Numbers that can be expressed as the difference of the squares of primes in exactly seven distinct ways.at n=17A092003
• Sum of integers generated by n-1 substitutions, starting with 1, k -> k+1, k-1, .., 1.at n=14A093951
• a(n) = n*(n^2-1)*(3*n+2).at n=13A115056
• Primitive elements of A096490.at n=26A118671
• Abs(square of n-th prime minus cube of n-1).at n=49A151911
• Multi-bifurcating recursion of a factorial type based on the Eulerian numbers A008292 as a triangle sequence: t(n,k) = Sum_{j=0..k+1} (-1)^j * binomial(n + 1, j)*(k + 1 - j)^n; f(n, m) = If[m <= floor(n/2), f(m, 1)*f(n - m, 1)*t(n + 1, m)].at n=6A155556
• Array A(n, k) = Product_{j=1..n} ( j - (1+j)*(k+1) + (k+1)^(j+1) ) with A(n, 0) = n!, read by antidiagonals.at n=26A156579
• a(n) = n*(n + 7)*(n + 14)*(n + 21)*(n + 28)/120.at n=12A264449
• a(n) = n*(945*n^4 - 3150*n^3 + 4095*n^2 - 2370*n + 496).at n=3A272358
• Smallest c which can be split into positive parts a and b with a+b=c, such that the divisors of a,b,c cover all numbers up to n.at n=25A346971
• Smallest c which can be split into positive parts a and b with a+b=c, such that the divisors of a,b,c cover all numbers up to n.at n=26A346971