41094
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, 0), (-1, 0, -1), (-1, 0, 0), (0, 1, 1), (1, 0, 0)}.at n=9A149981
- p-INVERT of (1,0,0,1,0,0,0,0,0,0,...), where p(S) = 1 - S^2.at n=36A292402
- G.f. = Phi*F^5, where Phi = g.f. for A028930, F = g.f. for A028959.at n=16A328536
- Sum of numbers of ways to choose a k-chain of divisors of n - k, for k = 0..n - 1.at n=35A343940