29505

Appears in sequences

• a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=35A004949
• Starting index of a string of 4 or more consecutive equal digits in decimal expansion of Pi.at n=26A049516
• Starting index of a string of exactly 4 consecutive equal digits in decimal expansion of Pi.at n=15A049520
• Starting positions of strings of three 7's in the decimal expansion of Pi.at n=31A083631
• Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=59A100862
• Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=61A100862
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 2, read by rows.at n=46A157148
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 2, read by rows.at n=53A157148
• a(n) = n*(2*n^2 + 5*n + 17)/2.at n=30A163661
• Number of rooted trees with n nodes having some subtrees replaced by cycles such that no leaf nodes are left over.at n=21A213682
• Numbers n such that n^2 + 1, (n+1)^2 + 1 and (n+2)^2 + 1 are divisible by a square.at n=6A218048
• T(n,k) = Number of idempotent n X n 0..k matrices of rank 2.at n=20A224114
• Number of partitions p of n such that exactly one number is in both p and its conjugate.at n=48A240675
• E.g.f.: exp(Sum_{n>=1} A081362(n)*x^n/n).at n=8A294340
• Array read by descending antidiagonals: A(n,k) is the number of chiral pairs of colorings of the facets of a regular n-dimensional orthoplex using up to k colors.at n=30A325014
• Number of chiral pairs of colorings of the 8 triangular faces of a regular octahedron or the 8 vertices of a cube using n or fewer colors.at n=5A337896
• Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=58A346520
• Number of partitions of the (n+3)-multiset {0,0,0,1,2,...,n} into distinct multisets.at n=7A346813
• Number of partitions of the (n+7)-multiset {0,...,0,1,2,...,7} with n 0's into distinct multisets.at n=3A346827
• G.f. A(x) satisfies: A(x) = (1 - x) / (1 - 2 * x - x^2 - x^3 * A(x)).at n=11A349186