%I #71 Dec 10 2015 04:14:40
%S 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,
%T 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,
%U 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
%N Number of distinct representations of n as a product of nonunit Fibonacci numbers (order doesn't matter).
%H Alois P. Heinz, <a href="/A261769/b261769.txt">Table of n, a(n) for n = 1..20000</a>
%e For n = 144 there are three representations: 144, 8*3*3*2, and 3*3*2*2*2*2, so a(144) = 3.
%Y Cf. A065108.
%K nonn
%O 1,8
%A _Jeffrey Shallit_, Nov 19 2015