Kata

Imagine a honeycomb - a field of hexagonal cells with side N. There is a bee in the top left cell A. In one move it can crawl one cell down, one cell down-right or one cell up-right (the bee does not crawl up or left).

Write a function that outputs the number of ways the bee can crawl from cell A to the opposite cell B.

Input data:

The function receives a single number N - the size of the hexagonal field 2 ≤ N ≤ 200.

Output data:

The function should output a single integer - the number of ways.

Example:

the_bee(2) --> 11
the_bee(3) --> 291
the_bee(5) --> 259123

Code length limit:

To prevent hardcoding, your code cannot exceed 1 000 characters.

If you have the desire and time, I would be very grateful if you can help in the development of this kata, to translate, or whatever else. I can be contacted via Telegram.

If you want to solve our problems, they are here: From Singularity Hub Community