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.

A025183 a(n) = T(2n-1,n), where T is the array defined in A025177.

This page as a plain text file.
%I A025183 #9 Jul 28 2016 16:23:11
%S A025183 0,4,20,111,616,3465,19668,112476,647088,3741156,21718520,126520240,
%T A025183 739225704,4330188265,25421864580,149541718275,881200519200,
%U A025183 5200715525016,30736780735752,181886951796886
%N A025183 a(n) = T(2n-1,n), where T is the array defined in A025177.
%F A025183 Conjecture: 9*n*(10833*n-26779)*(3*n-4)*(3*n-2)*a(n) -3*(n-1)*(749757*n^3+5096
%F A025183 41*n^2-11324756*n+13648560)*a(n-1) -2*(2*n-5)*(4152209*n^3-25903434*n^2+5658913
%F A025183 6*n-40818816)*a(n-2) -36*(n-3)*(85207*n-129510)*(2*n-5)*(2*n-7)*a(n-3)=0. - _R. J. Mathar_, Feb 25 2015
%p A025183 A025183 := proc(n)
%p A025183         A025177(2*n-1,n) ;
%p A025183 end proc: # _R. J. Mathar_, Jul 28 2016
%K A025183 nonn
%O A025183 1,2
%A A025183 _Clark Kimberling_
%E A025183 First term corrected. - _R. J. Mathar_, Feb 25 2015