login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025183 a(n) = T(2n-1,n), where T is the array defined in A025177. 1

%I #9 Jul 28 2016 16:23:11

%S 0,4,20,111,616,3465,19668,112476,647088,3741156,21718520,126520240,

%T 739225704,4330188265,25421864580,149541718275,881200519200,

%U 5200715525016,30736780735752,181886951796886

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

%F Conjecture: 9*n*(10833*n-26779)*(3*n-4)*(3*n-2)*a(n) -3*(n-1)*(749757*n^3+5096

%F 41*n^2-11324756*n+13648560)*a(n-1) -2*(2*n-5)*(4152209*n^3-25903434*n^2+5658913

%F 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 := proc(n)

%p A025177(2*n-1,n) ;

%p end proc: # _R. J. Mathar_, Jul 28 2016

%K nonn

%O 1,2

%A _Clark Kimberling_

%E First term corrected. - _R. J. Mathar_, Feb 25 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)