109269

Appears in sequences

• a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=28A022875
• 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), (1, 0, -1), (1, 0, 0), (1, 1, -1)}.at n=11A148353
• Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1).at n=20A357717