352947

Appears in sequences

• Triangle of coefficients in expansion of (1+7x)^n.at n=33A013614
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j).at n=30A027466
• a(n) = 7^(n-2) * C(n,2).at n=5A027474
• Numbers whose prime factors are 3 and 7.at n=29A033850
• Triangle of numbers related to rooted trees and unrooted planar trees.at n=26A056856
• Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.at n=30A071207
• a(n) = n^(n-2) * binomial(n,2).at n=7A081131
• Duplicate of A027474.at n=7A081137
• Number of walks of length n between two adjacent nodes in the cycle graph C_9.at n=20A095364
• Triangle, read by rows, such that row n equals the inverse binomial transform of row n of table A060543, where A060543(n,k) = C(n+n*k+k, n*k+k).at n=26A108290
• Triangle, read by rows, resulting from the matrix product of triangle A108267 with Pascal's triangle (A007318).at n=22A108291
• a(n) is the number of shapes of balanced trees with constant branching factor 7 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=13A131893
• Triangle read by rows: characteristic polynomials of Z/nZ addition tables considered as matrices.at n=36A140059
• a(n) = 3*7^n.at n=6A169634
• Smallest number with n prime divisors (counted with multiplicity) which is not divisible by a(k) for any k < n.at n=6A197082
• Triangular array T; for n>0, row n shows the coefficients of a reduced polynomial having zeros -k/(n+1) for k=1,2,...,n.at n=26A203904
• Number of nX7 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=1A222443
• T(n,k) = number of n X k 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=29A222444
• T(n,k) = number of n X k 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=34A222444
• Triangular array read by rows. T(n,k) is the number of cycles in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n} that have length k; 1<=k<=n.at n=22A225213