25587

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, 0, 0), (0, -1, 1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=9A148970
• a(0)=2, a(n) = n^2+a(n-1).at n=42A153056
• a(n) = A056520(n)+1 for n>0, a(0)=1.at n=42A179904
• a(n) is the least k such that f(a(n-1)+1) + ... + f(k) > f(a(n-2)+1) + ... + f(a(n-1)) for n > 1, where f(n) = 1/(n+6) and a(1) = 1.at n=8A225921
• Numbers k such that there is no prime p and index j < k such that A002182(k) = p * A002182(j).at n=9A272606