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