cp's OEIS Frontend

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.

A022117 Fibonacci sequence beginning 2, 15.

This page as a plain text file.
%I A022117 #24 Sep 22 2024 13:51:13
%S A022117 2,15,17,32,49,81,130,211,341,552,893,1445,2338,3783,6121,9904,16025,
%T A022117 25929,41954,67883,109837,177720,287557,465277,752834,1218111,1970945,
%U A022117 3189056,5160001,8349057,13509058,21858115,35367173,57225288,92592461,149817749
%N A022117 Fibonacci sequence beginning 2, 15.
%H A022117 Ivan Panchenko, <a href="/A022117/b022117.txt">Table of n, a(n) for n = 0..1000</a>
%H A022117 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022117 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022117 G.f.: (2+13*x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022117 a(n) = a(n-1) + a(n-2). - _Wesley Ivan Hurt_, Oct 01 2021
%t A022117 a={};b=2;c=15;AppendTo[a,b];AppendTo[a,c];Do[b=b+c;AppendTo[a,b];c=b+c;AppendTo[a,c],{n,1,40,1}];a (* _Vladimir Joseph Stephan Orlovsky_, Jul 23 2008 *)
%t A022117 Transpose[NestList[{#[[2]],#[[1]]+#[[2]]}&,{2,15},40]][[1]] (* _Harvey P. Dale_, Dec 16 2010 *)
%t A022117 CoefficientList[Series[(2 + 13 x)/(1 - x - x^2), {x, 0, 40}], x] (* _Wesley Ivan Hurt_, Jun 15 2014 *)
%t A022117 LinearRecurrence[{1,1},{2,15},40] (* _Harvey P. Dale_, Sep 22 2024 *)
%K A022117 nonn,easy
%O A022117 0,1
%A A022117 _N. J. A. Sloane_, Jun 14 1998
%E A022117 More terms from _Wesley Ivan Hurt_, Jun 15 2014