login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A334370
Expansion of e.g.f. Product_{k>=1} (1 + x^prime(k) / prime(k)!).
6
1, 0, 1, 1, 0, 11, 0, 22, 56, 36, 2640, 1, 8712, 79, 72436, 360465, 48608, 49008961, 794376, 4232764, 7753140, 942565890, 18198334, 14799637777, 10577976, 366619314900, 2785137222400, 1475339135400, 1065920156634060, 3765722000041, 5869315258699050
OFFSET
0,6
COMMENTS
a(n) is the number of functions f:[n]-> [n] such that the number of elements that are mapped to i is either 0 or the i-th prime. a(5) = 11: (33333), (11222), (12122), (12212), (12221), (21122), (21212), (21221), (22112), (22121), (22211). - Alois P. Heinz, Jul 18 2023
LINKS
MAPLE
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, b(n, i-1)+
(p-> `if`(p>n, 0, b(n-p, i-1)*binomial(n, p)))(ithprime(i))))
end:
a:= n-> b(n, numtheory[pi](n)):
seq(a(n), n=0..30); # Alois P. Heinz, Jul 18 2023
MATHEMATICA
nmax = 30; CoefficientList[Series[Product[(1 + x^Prime[k]/Prime[k]!), {k, 1, nmax}], {x, 0, nmax}], x] Range[0, nmax]!
a[n_] := a[n] = If[n == 0, 1, (n - 1)! Sum[DivisorSum[k, -#/(-#!)^(k/#) &, PrimeQ[#] &] a[n - k]/(n - k)!, {k, 1, n}]]; Table[a[n], {n, 0, 30}]
PROG
(PARI) my(N=40, x='x+O('x^N)); Vec(serlaplace(prod(k=1, N, 1+isprime(k)*x^k/k!))) \\ Seiichi Manyama, Feb 27 2022
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, May 11 2020
STATUS
approved