60241
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, 1, 0), (1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=8A150788
- Let f(p,i) = smallest prime m >= p such that m == i (mod p); a(n) = Sum_{i=0..p-1} f(p,i), where p = n-th prime.at n=27A243076