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!)
A274117 a(n) = ((6n-5)!!!+(6n-4)!!!)/(6n-3). 2
1, 12, 1064, 252160, 115315200, 86449126400, 96313245952000, 149342026677043200, 307513455044956160000, 811744577542368870400000, 2672529840751688498380800000, 10735527449319396895332761600000, 51677469466519591978527317032960000, 293652804750537765304678163152896000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sequence is similar to A273889, with a similar proof of divisibility.
LINKS
FORMULA
a(n) = ((6n-5)!!!+(6n-4)!!!)/(6n-3).
EXAMPLE
a(1) = (1+2)/3 = 1;
a(2) = (1*4*7+2*5*8)/9 = 12;
a(3) = (1*4*7*10*13+2*5*8*11*14)/15 = 1064.
MATHEMATICA
B[n_, k_] := (Product[k (i - 1) + 1, {i, 2 n - 1}] + Product[k (i - 1) + 2, {i, 2 n - 1}])/(2 k (n - 1) + 3); Table[B[n, 3], {n, 14}] (* Michael De Vlieger, Jun 10 2016 *)
PROG
(Python)
triplefac=lambda x:1 if x<2 else x*triplefac(x-3)
for i in range(1, 101):
print(i, (triplefac(6*i-5)+triplefac(6*i-4))//(6*i-3))
CROSSREFS
Sequence in context: A232912 A004812 A088671 * A295427 A354822 A260030
KEYWORD
nonn
AUTHOR
STATUS
approved

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 April 24 05:49 EDT 2024. Contains 371918 sequences. (Running on oeis4.)