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 A239000 #10 Mar 13 2014 23:02:42
%S A239000 1,0,0,1,0,1,1,0,2,1,1,2,1,3,2,2,4,2,4,4,3,7,4,5,8,5,9,8,7,12,9,11,13,
%T A239000 11,17,14,15,20,16,22,22,20,29,24,27,33,28,37,36,35,45,40,46,50,47,60,
%U A239000 55,58,69,62,75,76,73,91,84,91,102,95,114,112,113
%N A239000 Number of partitions of n using Fibonacci numbers > 2.
%H A239000 Alois P. Heinz, <a href="/A239000/b239000.txt">Table of n, a(n) for n = 0..1000</a>
%F A239000 G.f.: 1/Product_{i>=4} (1 - x^Fibonacci(i)).
%e A239000 a(21) counts these partitions: [21], [13,8], [13,5,3], [8,8,5], [8,5,5,3], [5,5,5,3,3], [3,3,3,3,3,3,3].
%t A239000 p[n_] := IntegerPartitions[n, All, Fibonacci@Range[4, 60]]; Table[p[n], {n, 0, 12}] (*shows partitions*)
%t A239000 a[n_] := Length@p@n; a /@ Range[0, 80] (*counts partitions, A239000*)
%o A239000 (PARI) N=66; q='q+O('q^N); Vec( 1/prod(n=1,11,1-q^fibonacci(n+3)) ) \\ _Joerg Arndt_, Mar 11 2014
%Y A239000 Cf. A000045, A003107, A238999.
%K A239000 nonn,easy
%O A239000 0,9
%A A239000 _Clark Kimberling_, Mar 08 2014