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.

A106734 a(n) = n^3 - 7*n + 7.

This page as a plain text file.
%I A106734 #25 Sep 11 2021 03:59:04
%S A106734 1,1,13,43,97,181,301,463,673,937,1261,1651,2113,2653,3277,3991,4801,
%T A106734 5713,6733,7867,9121,10501,12013,13663,15457,17401,19501,21763,24193,
%U A106734 26797,29581,32551,35713,39073,42637,46411,50401,54613,59053,63727
%N A106734 a(n) = n^3 - 7*n + 7.
%H A106734 G. C. Greubel, <a href="/A106734/b106734.txt">Table of n, a(n) for n = 1..1000</a>
%H A106734 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A106734 n*a(n) + n*(n-1)*7 = n^4.
%F A106734 G.f.: (1 - 3*x + 15*x^2 - 7*x^3)/(1-x)^4. - _Harvey P. Dale_, Feb 18 2018
%F A106734 E.g.f.: (7 - 6*x + 3*x^2 + x^3)*exp(x) - 7. - _G. C. Greubel_, Sep 11 2021
%e A106734 a(2) = 1, 1 + 15 = 2^4;
%e A106734 a(3) = 13, 13 + 27 + 41 = 3^4;
%e A106734 a(4) = 43, 43 + 57 + 71 + 85 = 4^4.
%t A106734 Table[n^3-7n+7,{n,40}] (* or *) LinearRecurrence[{4,-6,4,-1},{1,1,13,43},40] (* _Harvey P. Dale_, Feb 18 2018 *)
%o A106734 (PARI) a(n) = n^3 - 7*n + 7; \\ _Michel Marcus_, Sep 05 2013
%o A106734 (Sage) [n*(n^2 -7) +7 for n in (0..40)] # _G. C. Greubel_, Sep 11 2021
%Y A106734 Cf. A105551.
%K A106734 nonn,easy
%O A106734 1,3
%A A106734 Andras Erszegi (erszegi.andras(AT)chello.hu), May 14 2005
%E A106734 Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 16 2007