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.

A284756 (n + 1)^3*a(n + 1) = 2*(2*n + 1)*(5*n^2 + 5*n + 2)*a(n) - 8*n*(7*n^2 + 1)*a(n - 1) + 22*n*(n - 1)*(2*n - 1)*a(n - 2), with a(0) = 1, a(1) = 4 and a(2) = 28.

This page as a plain text file.
%I A284756 #38 Apr 02 2017 10:02:22
%S A284756 1,4,28,268,3004,36784,476476,6418192,88986172,1261473136,18200713168,
%T A284756 266393373712,3945664966204,59029237351504,890697897694192,
%U A284756 13539585443232688,207149418061499452,3187355160332835184,49290960047575223824,765703166164798253392
%N A284756 (n + 1)^3*a(n + 1) = 2*(2*n + 1)*(5*n^2 + 5*n + 2)*a(n) - 8*n*(7*n^2 + 1)*a(n - 1) + 22*n*(n - 1)*(2*n - 1)*a(n - 2), with a(0) = 1, a(1) = 4 and a(2) = 28.
%C A284756 This sequence is c_11 in the 2015 paper of Cooper et al.
%H A284756 Seiichi Manyama, <a href="/A284756/b284756.txt">Table of n, a(n) for n = 0..819</a>
%H A284756 S. Cooper, <a href="http://www-users.math.umn.edu/~stant001/ASKEYABS/Shaun_Cooper">Ramanujan's theories of elliptic functions to alternative bases, and beyond</a>, talk slides, Askey 80 Conference, 2013.
%H A284756 S. Cooper, J. Ge and D. Ye, <a href="http://dx.doi.org/10.1016/j.jmaa.2014.07.061">Hypergeometric transformation formulas of degrees 3, 7, 11 and 23</a>, Journal of Mathematical Analysis and Applications, Volume 421, Issue 2, 15 January 2015, Pages 1358-1376.
%F A284756 a(n) ~ c * d^n / (Pi*n)^(3/2), where d = 16.8275008141470347474718307386716769... is the real root of the equation -44 + 56*d - 20*d^2 + d^3 = 0 and c = 1.83051467150137478416073409831908489312609... is the positive real root of the equation -1331 - 1020*c^2 - 1936*c^4 + 704*c^6 = 0. - _Vaclav Kotesovec_, Apr 02 2017
%t A284756 RecurrenceTable[{(n+1)^3*a[n+1] == 2*(2*n+1)*(5*n^2+5*n+2)*a[n] - 8*n*(7*n^2+1)*a[n-1] + 22*n*(n-1)*(2*n-1)*a[n-2], a[0]==1, a[1]==4, a[2]==28}, a, {n, 0, 20}] (* _Vaclav Kotesovec_, Apr 02 2017 *)
%o A284756 (Ruby)
%o A284756 def A284756(n)
%o A284756   a, b, c, i = 0, 0, 1, -1
%o A284756   ary = [0, 0]
%o A284756   while i < n
%o A284756     i += 1
%o A284756     j = 2 * (2 * i + 1) * (5 * i * i + 5 * i + 2) * c - 8 * i * (7 * i * i + 1) * b + 22 * i * (i - 1) * (2 * i - 1) * a
%o A284756     break if j % ((i + 1) ** 3) > 0
%o A284756     a, b, c = b, c, j / ((i + 1) ** 3)
%o A284756     ary << b
%o A284756   end
%o A284756   ary[2..-1]
%o A284756 end
%Y A284756 Cf. A184423 (c_3), A183204 (c_7), this sequence (c_11).
%K A284756 nonn
%O A284756 0,2
%A A284756 _Seiichi Manyama_, Apr 02 2017