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.

A090392 Seventh diagonal (m=6) of triangle A084938; a(n) = A084938(n+6,n) = (n^6 + 45*n^5 + 925*n^4 + 11475*n^3 + 92314*n^2 + 413640*n)/720.

This page as a plain text file.
%I A090392 #12 Jul 20 2016 14:53:29
%S A090392 0,720,1812,3428,5768,9090,13721,20069,28636,40032,54990,74382,99236,
%T A090392 130754,170331,219575,280328,354688,445032,554040,684720,840434,
%U A090392 1024925,1242345,1497284,1794800,2140450,2540322,3001068,3529938,4134815
%N A090392 Seventh diagonal (m=6) of triangle A084938; a(n) = A084938(n+6,n) = (n^6 + 45*n^5 + 925*n^4 + 11475*n^3 + 92314*n^2 + 413640*n)/720.
%H A090392 Chai Wah Wu, <a href="/A090392/b090392.txt">Table of n, a(n) for n = 0..1000</a>
%H A090392 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7, -21, 35, -35, 21, -7, 1).
%F A090392 a(n) = A084938(n+6, n) = Sum_{k=0..6} A090238(6, k)*binomial(n, k).
%F A090392 From _Chai Wah Wu_, Jun 04 2016: (Start)
%F A090392 a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7) for n > 6.
%F A090392 G.f.: x*(461*x^5 - 2482*x^4 + 5376*x^3 - 5864*x^2 + 3228*x - 720)/(x - 1)^7. (End)
%t A090392 LinearRecurrence[{7,-21,35,-35,21,-7,1},{0,720,1812,3428,5768,9090,13721},40] (* _Harvey P. Dale_, Jul 20 2016 *)
%o A090392 (Python)
%o A090392 A090392_list, m = [], [1, 5, 18, 58, 177, 461, 0]
%o A090392 for _ in range(1001):
%o A090392     A090392_list.append(m[-1])
%o A090392     print(m[-1])
%o A090392     for i in range(6):
%o A090392         m[i+1] += m[i] # _Chai Wah Wu_, Jun 04 2016
%Y A090392 Cf. A084938 A090238.
%K A090392 easy,nonn
%O A090392 0,2
%A A090392 _Philippe Deléham_, Jan 31 2004