The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216445 a(n) = !n mod n!!. 1
 0, 0, 1, 2, 1, 14, 25, 69, 241, 251, 2481, 6830, 4921, 119547, 250489, 780584, 8507745, 5562314, 2246113, 592853256, 853522921, 1510777190, 67329163881, 131984971712, 1849868497489, 132447220974, 29144172315025, 92977949123774, 608057424846873, 1214694444952016 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS !n is a subfactorial number (A000166). n!! is a double factorial number (A006882). LINKS Indranil Ghosh, Table of n, a(n) for n = 0..800 Indranil Ghosh, Python Program to generate the b-file EXAMPLE a(6) = !6 mod 6!! = 265 mod 48 = 25. - Indranil Ghosh, Feb 15 2017 MAPLE sf:= proc(n) option remember; n*procname(n-1)+(-1)^n end proc: sf(0):= 1: df:= proc(n) option remember; n*procname(n-2) end proc: df(0):= 1: df(1):= 1: map(t -> sf(t) mod df(t), [\$0..50]); # Robert Israel, Nov 16 2017 MATHEMATICA Table[Mod[Subfactorial[n], n!!], {n, 0, 30} ] CROSSREFS Cf. A006882, A000166. Sequence in context: A245733 A276851 A080346 * A124026 A106204 A290603 Adjacent sequences: A216442 A216443 A216444 * A216446 A216447 A216448 KEYWORD nonn AUTHOR Michel Lagneau, Sep 07 2012 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.

Last modified June 24 01:53 EDT 2024. Contains 373661 sequences. (Running on oeis4.)