A261769 Number of distinct representations of n as a product of nonunit Fibonacci numbers (order doesn't matter).

1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 0, 1, 1, 0, 0, 2, 1, 1, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 0, 1, 2, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 3, 1, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 0, 0, 1, 0, 2, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 2, 1, 0, 0, 1, 0, 1

Offset: 1

Author

Jeffrey Shallit, Nov 19 2015

Keywords

• nonn

Examples

			For n = 144 there are three representations: 144, 8*3*3*2, and 3*3*2*2*2*2, so a(144) = 3.
		

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..20000

Crossrefs

Cf. A065108.