19856

Appears in sequences

• Number of ternary rooted trees with n nodes and height exactly 5.at n=18A036420
• At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=30A056640
• Sides of integer Heronian triangles [A068967(n), prime(A068967(n)), a(n)] with area A068969(n).at n=22A068968
• Positive numbers of the form x^4 - 6 * x^2 * y^2 + y^4 (where x,y are integers).at n=39A135789
• The sequence of coefficients of a polynomial recursion: p(x,n)=If[Mod[n, 2] == 0, (x + 1)*p(x, n - 1), (x^2 + (2*n - 1)*x + 1)^Floor[n/2]] ( correction).at n=39A171146
• The sequence of coefficients of a polynomial recursion: p(x,n)=If[Mod[n, 2] == 0, (x + 1)*p(x, n - 1), (x^2 + (2*n - 1)*x + 1)^Floor[n/2]] ( correction).at n=41A171146
• E.g.f. A(x) satisfies 2*A(x) = x*(1 + A(x) + exp(A(x))).at n=5A186448
• The permanent of the distance matrix of the rooted tree having Matula number n.at n=19A206489
• The permanent of the distance matrix of the rooted tree having Matula number n.at n=20A206489
• The permanent of the distance matrix of the rooted tree having Matula number n.at n=28A206489
• The permanent of the distance matrix of the rooted tree having Matula number n.at n=33A206489
• Number of (n+1)X(1+1) 0..3 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=2A236495
• Number of (n+1)X(3+1) 0..3 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=0A236497
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=3A236500
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=5A236500
• Sum of the lengths of the arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.at n=40A264100
• Numbers which are representable as a sum of seventeen but no fewer consecutive nonnegative integers.at n=27A270302
• Composite numbers k such that 2^(k-1) == - lambda(k) (mod k), where lambda is the Carmichael lambda function (A002322).at n=5A330446
• Antidiagonal sums of the array defined in A385623.at n=28A385624