login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
0, 4, 20, 111, 616, 3465, 19668, 112476, 647088, 3741156, 21718520, 126520240, 739225704, 4330188265, 25421864580, 149541718275, 881200519200, 5200715525016, 30736780735752, 181886951796886 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..20.

FORMULA

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

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

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

MAPLE

A025183 := proc(n)

        A025177(2*n-1, n) ;

end proc: # R. J. Mathar, Jul 28 2016

CROSSREFS

Sequence in context: A158827 A263854 A026156 * A014523 A153299 A239643

Adjacent sequences:  A025180 A025181 A025182 * A025184 A025185 A025186

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

First term corrected. - R. J. Mathar, Feb 25 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 02:20 EDT 2021. Contains 343636 sequences. (Running on oeis4.)