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 A308062 #7 May 11 2019 02:13:58
%S A308062 1,1,1,1,1,2,0,2,1,2,0,3,1,0,2,3,0,3,0,3,1,0,0,6,1,2,1,0,0,6,0,4,0,1,
%T A308062 0,6,0,0,2,6,0,2,0,0,3,0,0,11,0,3,0,3,0,4,1,0,0,0,0,12,0,0,2,6,2,0,0,
%U A308062 2,0,0,0,13,0,0,3,0,0,6,0,11,1,0,0,3,0,0,0,0,1,12
%N A308062 Number of ordered factorizations of n into Fibonacci numbers > 1.
%F A308062 G.f. A(x) satisfies: A(x) = x + Sum_{k>=3} A(x^Fibonacci(k)).
%t A308062 terms = 90; A[_] = 0; Do[A[x_] = x + Sum[A[x^Fibonacci[k]], {k, 3, 25}] + O[x]^(terms + 1) // Normal, terms + 1]; Rest[CoefficientList[A[x], x]]
%t A308062 f[n_] := f[n] = SeriesCoefficient[Sum[x^Fibonacci[k], {k, 3, 25}], {x, 0, n}]; a[n_] := If[n == 1, n, Sum[If[d < n, f[n/d] a[d], 0], {d, Divisors[n]}]]; Table[a[n], {n, 1, 90}]
%Y A308062 Cf. A000045, A010056, A065105 (positions of zeros), A065108 (positions of nonzero terms), A074206.
%K A308062 nonn
%O A308062 1,6
%A A308062 _Ilya Gutkovskiy_, May 10 2019