This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A154029 List of pairs of numbers: {n^2-1, (2*n-1)!!} such that F((2*n-1)!!) = n^2 - 1. 1
 0, 1, 3, 3, 8, 15, 15, 105, 24, 945, 35, 10395, 48, 135135, 63, 2027025, 80, 34459425, 99, 654729075, 120, 13749310575, 143, 316234143225, 168, 7905853580625, 195, 213458046676875, 224, 6190283353629375, 255, 191898783962510625, 288 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS If you have two recursions ( addition and multiplication): a(n) = 2*n - 1 + a(n-1), a(n) = n*(n+1)/2, with a(0) = -1 and b(n) = (2*n - 1)*a(n-1), a(n) = n!, with b(0) = 1 then you can form a function F such that: F((2*n-1)!!) = n^2 - 1. LINKS G. C. Greubel, Table of n, a(n) for n = 0..800 FORMULA {n^2 - 1, (2*n - 1)!!}. MATHEMATICA Clear[a, b, n]; Flatten[Table[{n^2 - 1, (2*n - 1)!!}, {n, 1, 20}]] (* Produces terms *) (*addition*) a[0] = -1; a[n_] := a[n] = (2*n - 1) + a[n - 1]; Table[a[n] - (n^2 - 1), {n, 0, 20}] (* Demonstrates that a[n] = n^2 -1 *) (*multiplication*) b[0] = 1; b[n_] := b[n] = (2*n - 1)*b[n - 1]; Table[b[n] - (2*n - 1)!!, {n, 0, 20}] (* Demonstrates that b[n] = (2*n - 1)!! *) CROSSREFS Sequence in context: A126073 A126592 A055057 * A219349 A208964 A104864 Adjacent sequences:  A154026 A154027 A154028 * A154030 A154031 A154032 KEYWORD nonn,tabf AUTHOR Roger L. Bagula, Jan 04 2009 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.

Last modified August 18 14:04 EDT 2019. Contains 326100 sequences. (Running on oeis4.)