login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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
1, 1, 5, 12, 119, 135, 5039, 20160, 240219, 1545075, 39916799, 88550154, 6227020799, 42798202447, 698726730520, 10461394944000, 355687428095999, 1375276302469251, 121645100408831999, 845066215769150100 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..20.

MATHEMATICA

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 *)

CROSSREFS

Cf. A008275.

Sequence in context: A009427 A267271 A009754 * A332466 A323565 A195538

Adjacent sequences: A096311 A096312 A096313 * A096315 A096316 A096317

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Aug 01 2004

EXTENSIONS

More terms from Robert G. Wilson v, Aug 12 2004

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 December 4 10:32 EST 2022. Contains 358556 sequences. (Running on oeis4.)