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 A207539 #22 Jan 01 2021 03:26:15
%S A207539 1,1,1,1,1,1,1,1,1,1,1,1,12,23,45,89,177,353,705,1409,2817,5633,11265,
%T A207539 22529,45057,90102,180181,360317,720545,1440913,2881473,5762241,
%U A207539 11523073,23043329,46081025,92150785,184279041,368513025,736935948,1473691715
%N A207539 Dodecanacci numbers (12th-order Fibonacci sequence): a(n) = a(n-1) +...+ a(n-12) with a(0)=...=a(11)=1.
%H A207539 G. C. Greubel, <a href="/A207539/b207539.txt">Table of n, a(n) for n = 0..1000</a>
%H A207539 Kai Wang, <a href="https://www.researchgate.net/publication/344295426_IDENTITIES_FOR_GENERALIZED_ENNEANACCI_NUMBERS">Identities for generalized enneanacci numbers</a>, Generalized Fibonacci Sequences (2020).
%H A207539 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1,1,1,1,1).
%F A207539 G.f.: (1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11 +10*x^12)/(1 -2*x +x^13).
%p A207539 f12:=proc(n) option remember: if n<=12 then 1: else add(f12(n-i),i=1..12): fi: end:
%t A207539 LinearRecurrence[Table[1, {12}], Table[1, {12}], 100]
%o A207539 (PARI) x='x+O('x^50); Vec((1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11 +10*x^12)/(1-2*x+x^13)) \\ _G. C. Greubel_, Jul 28 2017
%Y A207539 Cf. A000045, A000213, A000288, A127624, A168083.
%K A207539 nonn,easy
%O A207539 0,13
%A A207539 _Michael Burkhart_, Feb 18 2012