44463
domain: N
Appears in sequences
- a(n) = (Sum_{i=0..n-1} 1/b(i)) * LCM{b(i): i=0..n-1}, where b(i) = C(i,floor(i/2)).at n=12A025553
- 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, -1, 0), (-1, 0, 1), (-1, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=9A149525
- a(n) = a(n-1) + 4*a(n-3) + 2*a(n-4) + 2*a(n-5); a(0) = a(1) = a(2) = 1, a(3) = 5, a(4) = 11.at n=15A337492
- Similar to A374525, but for each starting matrix with a choice of whether to sort by columns or rows first, such that the total number of sorting steps for this matrix is minimized.at n=10A374526
- Consecutive states of the linear congruential pseudo-random number generator 254*s mod (2^16+1) when started at s=1.at n=19A384934