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,8

Links

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

Example

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

Crossrefs

Cf. A065108.

Sequence in context: A076452 A076453 A263657 * A005590 A142598 A274372

Adjacent sequences: A261766 A261767 A261768 * A261770 A261771 A261772

Keyword

nonn

Author

Jeffrey Shallit, Nov 19 2015

Status

approved