18546

Appears in sequences

• a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=22A004949
• a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.at n=22A004969
• Number of series-reduced planted trees with n leaves of 2 colors and no symmetries.at n=10A031148
• Number of partitions of n into parts not of the form 25k, 25k+7 or 25k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=37A036006
• Number of asymmetric rooted Greg trees.at n=10A052301
• Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=39A063058
• Numbers k such that k and 2*k, taken together are pandigital.at n=10A115922
• Numbers k such that k and 5*k, taken together, are pandigital.at n=10A115925
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 1, 1), (1, -1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A151009
• Number of nondecreasing -3..3 vectors of length n whose dot product with some other -3..3 vector equals n.at n=11A226335
• Number of symmetrically unique Dyck paths of semilength 2n and height n.at n=6A291885
• Number of symmetrically unique Dyck paths of semilength n and height six.at n=6A291890
• a(n) = [x^n] (Sum_{k=0..n} k!*x^k)/(Sum_{k=0..n} k!*(-x)^k).at n=8A303565
• Array read by antidiagonals: T(m,n) = number of m X n matrices M with entries {0,1,2} that have M_{1,1}=0, M_{m,n}=2, are such that the rows and columns are monotonic without jumps of 2, and satisfy M_{(i+1),(j+1)} = M_{i,j} + (0 or 1).at n=58A323846
• Array read by antidiagonals: T(m,n) = number of m X n matrices M with entries {0,1,2} that have M_{1,1}=0, M_{m,n}=2, are such that the rows and columns are monotonic without jumps of 2, and satisfy M_{(i+1),(j+1)} = M_{i,j} + (0 or 1).at n=62A323846
• Number of 4 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{4,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.at n=8A323968
• Number of 8 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{8,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.at n=4A323972