50775

Appears in sequences

• Number of triangle-free planar graphs with n nodes.at n=10A049367
• G.f.: 1/(1-5*x+10*x^3-5*x^4).at n=7A200781
• T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents.at n=32A200785
• Number of 0..n arrays x(0..6) of 7 elements without any two consecutive increases.at n=3A200789
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.at n=38A214510
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 9, n >= 2.at n=15A214608
• a(n) = (n+1)*(n^3+15*n^2+74*n+132)/12.at n=24A217947
• a(n) = n^6 + 5*n^5 + 19*n^4 + 44*n^3 + 72*n^2 + 69*n + 5.at n=5A270870
• Numbers k such that k![4] - 128 is prime, where k![4] = A007662(k) = quadruple factorial.at n=43A329176
• Triangle read by rows: T(n,k) is the number of digraphs on n labeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)^2.at n=26A350793