This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A147625 Octo-factorial numbers(4). 5
 1, 5, 65, 1365, 39585, 1464645, 65909025, 3493178325, 213083877825, 14702787569925, 1132114642884225, 96229744645159125, 8949366251999798625, 903885991451979661125, 98523573068265783062625 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n+1) = Sum_{k, 0<=k<=n}A132393(n,k)*5^k*8^(n-k). [Philippe Deléham, Nov 09 2008] a(n) = (-3)^n*sum_{k=0..n} (8/3)^k*s(n+1,n+1-k), where s(n,k) are the Stirling numbers of the first kind, A048994. [Mircea Merca, May 03 2012] a(n) +(-8*n+11)*a(n-1)=0. - R. J. Mathar, Sep 04 2016 From Benedict W. J. Irwin, Sep 30 2016: (Start) a(n) = Product_{k=0..n-1} 8*k+5. a(n) = 8^n*Gamma(5/8 + n)/Gamma(5/8). E.g.f: 1/(1 - 8*x)^(5/8). (End) a(n)/n! ~ 8^n/(Gamma(5/8)*n^(3/8)). - Vaclav Kotesovec, Oct 04 2016 MATHEMATICA s=1; lst={s}; Do[s+=n*s; AppendTo[lst, s], {n, 4, 2*5!, 8}]; lst Table[Product[(8k+5), {k, 0, n-1}], {n, 0, 20} (* Benedict W. J. Irwin, Sep 30 2016 *) CROSSREFS Sequence in context: A056245 A195886 A079482 * A157097 A234295 A251575 Adjacent sequences:  A147622 A147623 A147624 * A147626 A147627 A147628 KEYWORD nonn,easy AUTHOR Vladimir Joseph Stephan Orlovsky, Nov 08 2008 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 October 18 12:18 EDT 2019. Contains 328160 sequences. (Running on oeis4.)