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!)
A110376 a(n) = Sum_{r < n, gcd(r,n)=1} n!/r. 2
1, 2, 9, 32, 250, 864, 12348, 67584, 804816, 5760000, 116915040, 686776320, 19323757440, 157991178240, 2951575200000, 42301705420800, 1202482800691200, 10048607738265600, 425162773111910400, 4541227794432000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(6) = 6!(1/1 + 1/5) = 864.
MAPLE
a:=proc(n) local s, r: s:=0: for r from 1 to n do if gcd(r, n)=1 then s:=s+1/r else s:=s: fi: od: n!*s end: seq(a(n), n=1..23); # Emeric Deutsch, Jul 25 2005
MATHEMATICA
Do[Print[n! * Plus @@ Map[(1/#)&, Select[Range[n], GCD[ #, n] == 1 &]]], {n, 1, 30}] (* Ryan Propper, Jul 25 2005 *)
CROSSREFS
Sequence in context: A179230 A114853 A331727 * A335577 A338437 A296151
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, Jul 24 2005
EXTENSIONS
More terms from Emeric Deutsch, Ryan Propper and Reinhard Zumkeller, Jul 25 2005
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)