This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A246661 Run Length Transform of swinging factorials (A056040). 9
 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 2, 2, 6, 6, 1, 1, 1, 2, 1, 1, 2, 6, 2, 2, 2, 4, 6, 6, 6, 30, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 2, 2, 6, 6, 2, 2, 2, 4, 2, 2, 4, 12, 6, 6, 6, 12, 6, 6, 30, 20, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 2, 2, 6, 6, 1, 1, 1, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS For the definition of the Run Length Transform see A246595. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..8191 FORMULA a(2^n-1) = n\$ where n\$ is the swinging factorial of n, A056040(n). MATHEMATICA f[n_] := n!/Quotient[n, 2]!^2; Table[Times @@ (f[Length[#]]&) /@ Select[ Split[ IntegerDigits[n, 2]], #[[1]] == 1&], {n, 0, 85}] (* Jean-François Alcover, Jul 11 2017 *) PROG (Sage) # For the function RLT see A246660. A246661_list = lambda len: RLT(lambda n: factorial(n)/factorial(n//2)^2, len) A246661_list(88) CROSSREFS Cf. A227349, A246588, A246595, A246596, A246660. Sequence in context: A117848 A025242 A163982 * A246660 A245405 A233543 Adjacent sequences:  A246658 A246659 A246660 * A246662 A246663 A246664 KEYWORD nonn,base AUTHOR Peter Luschny, Sep 07 2014 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 15 07:56 EDT 2019. Contains 328026 sequences. (Running on oeis4.)