57053
domain: N
Appears in sequences
- 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, 1), (-1, 0, 1), (0, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=9A149972
- Asymptotic value of odd Catalan numbers mod 2^n.at n=16A178854
- Integers m such that A014448(m) == 1 (mod m).at n=10A335722
- Sum of numbers of ways to choose a k-chain of divisors of n - k, for k = 0..n - 1.at n=37A343940