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.

A014101 a(n) = a(n-1) + a(n-4), starting 1,1,1,3.

This page as a plain text file.
%I A014101 #17 Jul 08 2025 02:52:41
%S A014101 1,1,1,3,4,5,6,9,13,18,24,33,46,64,88,121,167,231,319,440,607,838,
%T A014101 1157,1597,2204,3042,4199,5796,8000,11042,15241,21037,29037,40079,
%U A014101 55320,76357,105394,145473,200793,277150
%N A014101 a(n) = a(n-1) + a(n-4), starting 1,1,1,3.
%H A014101 Vincenzo Librandi, <a href="/A014101/b014101.txt">Table of n, a(n) for n = 0..1000</a>
%H A014101 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1).
%F A014101 G.f.: (-2*x^3-1)/(x^4+x-1). - _Harvey P. Dale_, Aug 29 2012
%F A014101 a(n) = 2*A003269(n-2) + A003269(n+1), n>1. - _Ralf Stephan_, Aug 15 2013
%t A014101 LinearRecurrence[{1,0,0,1},{1,1,1,3},40] (* or *) CoefficientList[ Series[ (-1-2 x^3)/(-1+x+x^4),{x,0,40}],x] (* _Harvey P. Dale_, Aug 29 2012 *)
%K A014101 nonn,easy
%O A014101 0,4
%A A014101 _N. J. A. Sloane_