46512

Appears in sequences

• Powers of rooted tree enumerator.at n=16A000529
• Cluster series for square lattice.at n=14A003203
• Fibonacci sequence beginning 0, 18.at n=18A022352
• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 0, 1, 2, 0.at n=19A025251
• a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2*n-1) = 7. Also a(n) = T(2*n-1,n-3), where T is the array defined in A026009.at n=7A026018
• a(n) = n*(n + 1)*(n + 2)*(n + 3)/2.at n=16A033486
• a(n) = n*Fibonacci(n).at n=18A045925
• a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).at n=14A065346
• Numbers k such that 2k-1 divides 2^k-1.at n=27A081856
• Starting positions of strings of four 5's in the decimal expansion of Pi.at n=5A083621
• Maximal number of 165432 patterns in a permutation of 1,2,...,n.at n=22A100356
• Triangle read by rows: T(n,k) is the number of nonroot nodes of outdegree k (0<=k<=n-1) in all non-crossing trees with n edges.at n=30A100400
• Second row of array in A101385.at n=23A101644
• Third row of array in A101385.at n=9A101645
• Divide each Fibonacci number by its primitive part.at n=35A105602
• Expansion of 1/((x-1)*(x+1)*(x^2+x+1)*(x^2+x-1)*(x^2-x+1)*(x^2+1)*(x^4-x^2+1)).at n=23A109609
• a(n) = C(1+n,1) * C(2+n,1) * C(4+n,2).at n=15A112415
• Duplicate of A045925.at n=18A116562
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross the x-axis k times (n>=1, k>=0).at n=47A118920
• E.g.f. satisfies: A'(x) = (1 + x*A(x))^3 with A(0)=1.at n=7A144008