56196

Appears in sequences

• Number of paths through an array.at n=7A006675
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges.at n=22A071208
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges.at n=26A071208
• Number of base 28 n-digit numbers with adjacent digits differing by three or less.at n=5A126496
• Ordered forests of k increasing unordered trees on the vertex set {1,2,...,n} in which all outdegrees are <= 2.at n=30A185421
• Number of non-equivalent (mod D_4) binary n X n matrices with 4 pairwise nonadjacent 1's.at n=6A239576
• Triangular array with n-th row giving coefficients of polynomial Product_{k = 2..n} (k + n*t) for n >= 1.at n=22A260687
• Generating function f(x)=(x+(x+(x+(x+(x+...)^5)^4)^3)^2)^1 is the limit as n->infinity of (f_1(x)=x, f_2(x)=x+x^2, f_3(x)=x+(x+x^3)^2, f_4(x)=x+(x+(x+x^4)^3)^2, ...).at n=30A276436
• Terms of A319928 that are congruent to 4 modulo 8: Numbers k == 4 (mod 8) such that there is no other m such that (Z/mZ)* is isomorphic to (Z/kZ)*, where (Z/kZ)* is the multiplicative group of integers modulo k.at n=41A372755
• Integers k such that there are i groups of order k+i up to isomorphism, for i=1,2,3.at n=33A373649