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!)
A209388 Product of positive odd integers smaller than n and relatively prime to n. 2

%I #23 Mar 12 2022 14:08:18

%S 1,1,1,3,3,5,15,105,35,189,945,385,10395,19305,1001,2027025,2027025,

%T 85085,34459425,8729721,230945,1249937325,13749310575,37182145,

%U 4216455243,608142583125,929553625,1452095555625,213458046676875,215656441,6190283353629375

%N Product of positive odd integers smaller than n and relatively prime to n.

%C This is the product over the smallest positive representatives of the odd reduced residue class Modd n. For Modd n (not to be confused with mod n) see a comment on A203571. This reduced residue class has delta(n)=A055034(n) members.

%C The Moddn values of this sequence are given in A209339.

%H Vincenzo Librandi, <a href="/A209388/b209388.txt">Table of n, a(n) for n = 1..200</a>

%F a(n) = product(2*k+1, k from {0,1,...,floor((n-2)/2)} and gcd(2*k+1,n) =1). a(1):=1 (empty product).

%F a(n) = product(k, k from {1,...,n-1} and gcd(k,2*n) = 1). a(1):=1 (empty product).

%F a(prime(n)) = (prime(n)-2)!! = A207332(n), for primes prime(n)=A000040(n).

%e a(4)= 1*3 = 3, a(5) = 1*3 =3, a(15) = 1*7*11*13 = 1001, delta(15)=phi(2*15)/2) = 1*2*4/2 = 4 = A055034(15).

%t Table[Times @@ Select[Range[1, n, 2], GCD[n, #] == 1 &], {n, 40}] (* _T. D. Noe_, Mar 12 2012 *)

%o (PARI) a(n) = prod(k=1, n, if (k % 2, k, 1)); \\ _Michel Marcus_, Mar 12 2022

%Y Cf. A001783 (mod n analog), A207332, A209339.

%K nonn,easy

%O 1,4

%A _Wolfdieter Lang_, Mar 10 2012

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 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)