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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096308 a(n) = Sum_{d divides n} (-1)^(n-d)*Stirling1(n,d). 4
1, 2, 3, 18, 25, 620, 721, 24878, 158445, 1658782, 3628801, 429976228, 479001601, 26820722994, 639056694705, 10758464202978, 20922789888001, 3774016217836154, 6402373705728001, 1535093032367692372, 17443309565597717361, 237373353486966539746 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..450

MAPLE

a:= n-> add(abs(Stirling1(n, d)), d=numtheory[divisors](n)):

seq(a(n), n=1..23);  # Alois P. Heinz, May 10 2019

MATHEMATICA

f[n_] := Sum[ If[ Mod[n, d] == 0, (-1)^(n - d)StirlingS1[n, d], 0], {d, n}]; Table[ f[n], {n, 20}] (* Robert G. Wilson v, Aug 12 2004 *)

CROSSREFS

Sequence in context: A112664 A216890 A047191 * A073529 A134850 A163910

Adjacent sequences:  A096305 A096306 A096307 * A096309 A096310 A096311

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 09:40 EDT 2020. Contains 335446 sequences. (Running on oeis4.)