43810

Appears in sequences

• a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=37A010021
• Partial sums of A081660.at n=15A081661
• Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + 3^(n-1)*binomial(n-2, k -1) otherwise.at n=40A146987
• 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), (-1, 0, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.at n=9A149060
• Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array.at n=15A219715
• Signed recurrence over enriched r-trees: a(n) = (-1)^n + Sum_y Product_{i in y} a(y) where the sum is over all integer partitions of n - 1.at n=23A301470
• Smallest number k such that A345112(k) = n.at n=23A357361