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.

A166025 a(0) = 6, a(1) = 17, a(n+1) = a(n) + a(n-1) for n>0.

This page as a plain text file.
%I A166025 #30 Jan 03 2024 08:50:56
%S A166025 6,17,23,40,63,103,166,269,435,704,1139,1843,2982,4825,7807,12632,
%T A166025 20439,33071,53510,86581,140091,226672,366763,593435,960198,1553633,
%U A166025 2513831,4067464,6581295,10648759,17230054,27878813,45108867,72987680,118096547
%N A166025 a(0) = 6, a(1) = 17, a(n+1) = a(n) + a(n-1) for n>0.
%H A166025 G. C. Greubel, <a href="/A166025/b166025.txt">Table of n, a(n) for n = 0..1000</a>
%H A166025 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1)
%F A166025 G.f.: (6+11x)/(1-x-x^2). - _Philippe Deléham_, Oct 06 2009
%F A166025 a(n) = 6*A000045(n+1) + 11*A000045(n). - _R. J. Mathar_, Oct 06 2009
%F A166025 a(n) = Fibonacci(n+6) + Fibonacci(n+2) + Fibonacci(n-4). - _Greg Dresden_, Feb 18 2022
%t A166025 Join[{a=6,b=17},Table[c=a+b;a=b;b=c,{n,60}]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 28 2011 *)
%t A166025 Join[{6}, LinearRecurrence[{1, 1}, {17, 23}, 100]] (* _G. C. Greubel_, Apr 21 2016 *)
%K A166025 nonn
%O A166025 0,1
%A A166025 Akshay Verma (11akshayV(AT)nist.ac.th), Oct 04 2009
%E A166025 Edited by _N. J. A. Sloane_, Oct 05 2009