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.

A066237 First differences give A052849.

This page as a plain text file.
%I A066237 #31 Jan 22 2024 06:25:55
%S A066237 1,3,7,19,67,307,1747,11827,92467,818227,8075827,87909427,1045912627,
%T A066237 13499954227,187856536627,2803205272627,44648785048627,
%U A066237 756023641240627,13560771052696627,256850971870360627,5122654988223640627
%N A066237 First differences give A052849.
%C A066237 Partial sums of A098558. - _Sébastien Desbordes_, Dec 18 2023
%H A066237 Sébastien Desbordes, <a href="https://www.zupimages.net/viewer.php?id=23/51/j6dv.png">Showing why it is the partial sums of A098558</a>
%F A066237 From _Vladeta Jovovic_, Dec 20 2001: (Start)
%F A066237 a(n) = n*a(n-1) - (n-1)*a(n-2), a(0)=-1, a(1)=1.
%F A066237 a(n) = 2*A003422(n) - 1. (End)
%t A066237 RecurrenceTable[{a[0]==-1,a[1]==1,a[n]==n*a[n-1]-(n-1)a[n-2]},a,{n,30}] (* _Harvey P. Dale_, Dec 10 2013 *)
%Y A066237 Cf. A003422, A052849, A098558, A052582.
%K A066237 nonn,easy
%O A066237 1,2
%A A066237 Markus Sullivan (markus(AT)o-reading.co.uk), Dec 19 2001
%E A066237 More terms from _Jason Earls_, Jan 13 2002