# Puzzle 12468: Tribonacci calculation

Count red turns, F(0)=1, F(1)=2, F(2)=4, F(N)=F(N-1)+F(N-2)+F(N-3)

Play
Designer template
1 comment

**Author:** | scorpio |

**Date posted:** | 7/14/2019 12:05:10 AM |

**Difficulty (1..5):** | ? (0 votes) |

**Popularity:** | 0 (0 liked, 0 disliked) |

**Correct solution submitted:** | 1 |

## Solved by 1 players

Number of commands in the solution is shown in brackets. Shown as ? when not available.

©2009 Igor Ostrovsky and other contributors. Terms of use