28445

Appears in sequences

• Apply partial sum operator thrice to Fibonacci numbers.at n=17A014162
• a(n) = T(2n+1, n+2), T given by A027935.at n=8A027942
• Expansion of -x*(1-x)/(1+14*x+x^2)^3.at n=4A122575
• 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), (0, 0, 1), (1, -1, 0), (1, 1, 1)}.at n=8A150455
• 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, 1, -1), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=8A150456
• a(0) = A002858(1) = 1, followed by the greatest Ulam numbers A002858 to form a complete sequence (see algorithm below).at n=15A348413