41667

Appears in sequences

• Convoluted convolved Fibonacci numbers G_8^(r).at n=15A089115
• 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, 0), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=11A148152
• Palindromic numbers in bases 5 and 9 written in base 10.at n=13A259388
• Number of nX4 0..1 arrays with every element unequal to 0, 1, 3 or 4 king-move adjacent elements, with upper left element zero.at n=13A303804
• Number of (1,2,3)-matching compositions of n.at n=17A335514
• a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).at n=39A353150
• G.f. A(x) satisfies: 1 = Sum_{n=-oo..+oo} (x^n - 2*x*A(x))^n.at n=11A355868