102183

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, 0), (-1, 1, -1), (0, 0, 1), (1, 0, -1), (1, 1, -1)}.at n=11A148632
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=18A207107
• Odd numbers n divisible by 3 such that for all k >= 1 the numbers n*2^k - 1 and n*2^k + 1 do not form a twin prime pair.at n=15A237592