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 A245367 #21 Jan 27 2017 14:47:42
%S A245367 1,0,0,1,0,1,1,1,2,1,3,3,3,6,5,8,10,11,17,18,25,32,37,52,61,79,102,
%T A245367 123,163,200,254,326,402,519,649,819,1045,1305,1664,2096,2643,3358,
%U A245367 4220,5352,6759,8527,10806,13622,17237,21785,27501,34802,43934,55544,70209,88672,112131,141644,179018,226274,285860,361358
%N A245367 Compositions of n into parts 3, 5 and 7.
%H A245367 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,0,1,0,1).
%F A245367 G.f: 1/(1-x^3-x^5-x^7).
%F A245367 a(n) = a(n-3) + a(n-5) + a(n-7).
%e A245367 a(16) = 10: the compositions are the permutations of [5533] (there are 4!/2!2!=6 of them) and the permutations of [7333] (there are 4!/3!=4).
%t A245367 LinearRecurrence[{0,0,1,0,1,0,1},{1,0,0,1,0,1,1},70] (* _Harvey P. Dale_, Jan 27 2017 *)
%o A245367 (PARI) Vec(1/(1-x^3-x^5-x^7) +O(x^66)) \\ _Joerg Arndt_, Aug 20 2014
%Y A245367 Cf. A000073, A013979, A017818, A060945, A079956, A079957, A079971, A079973, A120400, A121833.
%K A245367 nonn,easy
%O A245367 0,9
%A A245367 _David Neil McGrath_, Aug 20 2014