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!)
A126868 a(n) = (n+1)!! mod n. 0

%I #6 Aug 22 2016 04:38:34

%S 0,1,2,3,3,3,6,1,6,5,1,3,8,7,0,1,13,9,1,15,0,11,1,9,0,13,0,7,17,15,1,

%T 1,0,17,0,27,6,19,0,25,9,21,1,11,0,23,46,33,0,25,0,39,30,27,0,49,0,29,

%U 58,15,50,31,0,1,0,33,1,51,0,35,1,9,27,37,0,19,0,39,78,65,0,41,82,63,0,43

%N a(n) = (n+1)!! mod n.

%e n=3 (n+1)!! = 4!! = 8; (8 mod 3) = 2.

%e n=4 (n+1)!! = 5!! = 15; (15 mod 4) = 3.

%p P:=proc(n) local i,j,k,w; for i from 1 by 1 to n do k:=i+1; w:=i-1; while w>0 do k:=k*w; w:=w-2; od; j:=(k mod i); print(j); od; end: P(100);

%o (PARI) df(n) = prod(i=0, (n-1)\2, n - 2*i );

%o a(n) = df(n+1) % n; \\ _Michel Marcus_, Aug 22 2016

%Y Cf. A006882, A000165, A001147, A119688.

%K easy,nonn

%O 1,3

%A _Paolo P. Lava_ and _Giorgio Balzarotti_, Mar 16 2007

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 September 12 19:04 EDT 2024. Contains 375853 sequences. (Running on oeis4.)