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 A022105 #27 Feb 18 2024 01:59:20
%S A022105 1,15,16,31,47,78,125,203,328,531,859,1390,2249,3639,5888,9527,15415,
%T A022105 24942,40357,65299,105656,170955,276611,447566,724177,1171743,1895920,
%U A022105 3067663,4963583,8031246,12994829
%N A022105 Fibonacci sequence beginning 1, 15.
%C A022105 a(n-1)=sum(P(15;n-1-k,k),k=0..ceiling((n-1)/2)), n>=1, with a(-1)=14. These are the SW-NE diagonals in P(15;n,k), the (15,1) Pascal triangle. Cf. A093645 for the (10,1) Pascal triangle. Observation by _Paul Barry_, Apr 29 2004. Proof via recursion relations and comparison of inputs.
%H A022105 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022105 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1)
%F A022105 a(n)= a(n-1)+a(n-2), n>=2, a(0)=1, a(1)=15. a(-1):=14.
%F A022105 G.f.: (1+14*x)/(1-x-x^2).
%F A022105 a(n) = A101220(14,0,n+1). - _Ross La Haye_, May 02 2006
%t A022105 a={};b=1;c=15;AppendTo[a,b];AppendTo[a,c];Do[b=b+c;AppendTo[a,b];c=b+c;AppendTo[a,c],{n,1,12,1}];a (* _Vladimir Joseph Stephan Orlovsky_, Jul 23 2008 *)
%t A022105 LinearRecurrence[{1,1},{1,15},40] (* _Harvey P. Dale_, Oct 11 2015 *)
%o A022105 (Magma) a0:=1; a1:=15; [GeneralizedFibonacciNumber(a0, a1, n): n in [0..30]]; // _Bruno Berselli_, Feb 12 2013
%Y A022105 a(n) = A109754(14, n+1).
%Y A022105 a(k) = A118654(4, k).
%K A022105 nonn,easy
%O A022105 0,2
%A A022105 _N. J. A. Sloane_