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!)
A130088 a(n) = numerator of Product_{k=1..n} k^mu(n+1-k), where mu(k) = A008683(k). 3

%I #13 Feb 12 2019 01:18:38

%S 1,2,3,2,5,3,7,1,3,25,22,21,104,21,20,11,408,585,380,55,6272,2431,

%T 14904,95,176000,25857,1008,149891,356352,10625,510136,35397,7904,

%U 224315,35280,776457,118513664,8265,135200,5425,143972204544,108150889

%N a(n) = numerator of Product_{k=1..n} k^mu(n+1-k), where mu(k) = A008683(k).

%e a(5) = numerator(1^(-1)*2^(0)*3^(-1)*4^(-1)*5^(1)) = numerator(5/12) = 5.

%p with(numtheory): a:=n->numer(mul(k^mobius(n+1-k),k=1..n)): seq(a(n),n=1..50); # _Emeric Deutsch_, May 09 2007

%o (PARI) a(n) = numerator(prod(k=1, n, k^moebius(n+1-k))); \\ _Michel Marcus_, Feb 12 2019

%Y Cf. A130086, A130087, A130089.

%K frac,nonn

%O 1,2

%A _Leroy Quet_, May 06 2007

%E More terms from _Emeric Deutsch_, May 09 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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)