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 A103380 #49 Sep 01 2024 02:47:41
%S A103380 1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,3,4,4,4,4,4,4,4,4,
%T A103380 4,4,4,5,7,8,8,8,8,8,8,8,8,8,8,9,12,15,16,16,16,16,16,16,16,16,16,17,
%U A103380 21,27,31,32,32,32,32,32,32,32,32,33,38,48,58,63,64,64,64,64,64,64,64,65
%N A103380 a(n) = a(n-12) + a(n-13).
%H A103380 T. D. Noe, <a href="/A103380/b103380.txt">Table of n, a(n) for n = 1..1000</a>
%H A103380 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,1,1).
%F A103380 For n>13: a(n) = a(n-12) + a(n-13). a(1) = a(2) = ... = a(13) = 1.
%F A103380 G.f.: x*(1-x^12) / ((1-x)*(1-x^12-x^13)). - _Colin Barker_, Mar 27 2013
%p A103380 A103380 := proc(n) option remember ; if n <= 13 then 1; else procname(n-12)+procname(n-13) ; fi; end: for n from 1 to 120 do printf("%d,",A103380(n)) ; od: # _R. J. Mathar_, Aug 30 2008
%t A103380 LinearRecurrence[{0,0,0,0,0,0,0,0,0,0,0,1,1},{1,1,1,1,1,1,1,1,1,1,1,1,1},90] (* _Harvey P. Dale_, Jul 16 2012 *)
%Y A103380 Cf. A079398, A103372-A103379, A103400.
%K A103380 easy,nonn
%O A103380 1,14
%A A103380 _Jonathan Vos Post_, Feb 16 2005
%E A103380 Terms from a(11) on corrected by _R. J. Mathar_, Aug 30 2008