login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096314 a(n) = Sum_{1<=k<=n, gcd(n,k)=1} (-1)^(n-k)*Stirling1(n,k). 1

%I

%S 1,1,5,12,119,135,5039,20160,240219,1545075,39916799,88550154,

%T 6227020799,42798202447,698726730520,10461394944000,355687428095999,

%U 1375276302469251,121645100408831999,845066215769150100

%N a(n) = Sum_{1<=k<=n, gcd(n,k)=1} (-1)^(n-k)*Stirling1(n,k).

%t f[n_] := Sum[ If[ GCD[n, k] == 1, (-1)^(n - k)StirlingS1[n, k], 0], {k, n}]; Table[ f[n], {n, 20}] (* _Robert G. Wilson v_, Aug 12 2004 *)

%Y Cf. A008275.

%K easy,nonn

%O 1,3

%A _Vladeta Jovovic_, Aug 01 2004

%E More terms from _Robert G. Wilson v_, Aug 12 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 13:46 EST 2020. Contains 331009 sequences. (Running on oeis4.)