login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308037 a(n) = Sum_{d|n} Stirling2(n,d). 4
1, 2, 2, 9, 2, 123, 2, 1830, 3027, 43038, 2, 2023728, 2, 49337473, 213142023, 2313595723, 2, 216927216877, 2, 6712023695345, 82312699558575, 366282502967439, 2, 113350450913387211, 2436684974110753, 1850568574287104493, 106563274551407600878, 231678790379913209098, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

a(n) = 2 <=> n is prime <=> n in { A000040 }. - Alois P. Heinz, May 10 2019

MAPLE

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

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

MATHEMATICA

a[n_] := a[n] = Sum[StirlingS2[n, d], {d, Divisors[n]}]; Table[a[n], {n, 1, 29}]

PROG

(PARI) a(n) = sumdiv(n, d, stirling(n, d, 2)); \\ Michel Marcus, May 10 2019

CROSSREFS

Cf. A000040, A008277, A056045, A096308.

Sequence in context: A327859 A343824 A182106 * A011403 A113554 A085846

Adjacent sequences:  A308034 A308035 A308036 * A308038 A308039 A308040

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, May 10 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 December 3 22:32 EST 2021. Contains 349468 sequences. (Running on oeis4.)