cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A186308 Number of lobsters with n nodes that are not caterpillars.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 11, 33, 95, 260, 696, 1816, 4659, 11795, 29520, 73267, 180485, 442157, 1077856, 2617726, 6336551, 15299287, 36857178, 88635225, 212829307, 510416549, 1222826994, 2927083468, 7001510693, 16737477645
Offset: 3

Views

Author

Washington Bomfim, Feb 23 2011

Keywords

Examples

			All the trees of order less than 7 are caterpillars. Only one tree with 7 nodes is a lobster and is not a caterpillar, so a(3)=a(4)=a(5)=a(6)=0, and a(7)=1.
		

Crossrefs

Formula

a(n) = A130131(n) - (2^(n-4) + 2^[(n-4)/2]).