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!)
A309169 a(n) = Product_{d|n} |Stirling1(n,d)|. 1
1, 1, 2, 66, 24, 7398000, 720, 445824751680, 4762759680, 100329999065856000, 3628800, 1019618790465528595884298768746577920000, 479001600, 97532934291415606872784896000, 5460491900297503751785620701184000, 1567611138605648558776157123803950409816473600000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

MAPLE

f:= proc(n) local d; mul(abs(combinat:-stirling1(n, d)), d=numtheory:-divisors(n)) end proc:

map(f, [$1..30]); # Robert Israel, Jul 15 2019

MATHEMATICA

Table[Product[Abs[StirlingS1[n, d]], {d, Divisors[n]}], {n, 1, 16}]

PROG

(PARI) a(n) = my(d=divisors(n)); prod(k=1, #d, abs(stirling(n, d[k], 1))); \\ Michel Marcus, Jul 16 2019

CROSSREFS

Cf. A008275, A058807, A096308, A309171.

Sequence in context: A003821 A055765 A265996 * A231946 A098089 A304934

Adjacent sequences:  A309166 A309167 A309168 * A309170 A309171 A309172

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Jul 15 2019

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 January 18 13:30 EST 2020. Contains 331007 sequences. (Running on oeis4.)