Combinatorics and Graph Theory · Problem 3.4.8

Generating Functions — David Guichard

Mathematics — Combinatorics · recurrence-relations-generating-functions

Problem

Find a recursion for the number of ways to place flags on an nn foot pole, where we have red flags that are 2 feet high, blue flags that are 1 foot high, and yellow flags that are 1 foot high; the heights of the flags must add up to nn. Solve the recursion.

Related theory

Browse the problem library