A205801
Expansion of e.g.f. exp( Sum_{n>=1} x^(n^2) / (n^2) ).
Original entry on oeis.org
1, 1, 1, 1, 7, 31, 91, 211, 1681, 52417, 461161, 2427481, 10744471, 219643711, 2619643027, 18939628891, 1410692293921, 23943786881281, 263853697605841, 2237281161036337, 53316533506210471, 900164075618402911, 11265158441537890891, 112769404714319769571
Offset: 0
E.g.f.: A(x) = 1 + x + x^2/2! + x^3/3! + 7*x^4/4! + 31*x^5/5! + 91*x^6/6! +...
where
log(A(x)) = x + x^4/4 + x^9/9 + x^16/16 + x^25/25 + x^36/36 +...
-
a:= proc(n) option remember; `if`(n=0, 1, add(`if`(issqr(j),
a(n-j)*(j-1)!*binomial(n-1, j-1), 0), j=1..n))
end:
seq(a(n), n=0..25); # Alois P. Heinz, May 12 2016
-
a[n_] := a[n] = If[n==0, 1, Sum[If[IntegerQ @ Sqrt[j], a[n-j]*(j-1)! * Binomial[n-1, j-1], 0], {j, 1, n}]]; Table[a[n], {n, 0, 25}] (* Jean-François Alcover, Feb 19 2017, after Alois P. Heinz *)
nmax = 25; CoefficientList[Series[Product[1/(1 - x^k)^(LiouvilleLambda[k]/k), {k, 1, nmax}], {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, Nov 17 2019 *)
-
{a(n)=n!*polcoeff(exp(sum(m=1, sqrtint(n+1), x^(m^2)/(m^2)+x*O(x^n))), n)}
-
a(n) = if(n==0, 1, (n-1)!*sum(k=1, sqrtint(n), a(n-k^2)/(n-k^2)!)); \\ Seiichi Manyama, Apr 29 2022
A273994
Number of endofunctions on [n] whose cycle lengths are Fibonacci numbers.
Original entry on oeis.org
1, 1, 4, 27, 250, 2975, 43296, 744913, 14797036, 333393345, 8403026320, 234300271811, 7161316358616, 238108166195263, 8556626831402560, 330494399041444425, 13654219915946513296, 600870384794864432897, 28060233470995898505024, 1386000542545570348128235
Offset: 0
-
b:= proc(n) option remember; local r, f, g;
if n=0 then 1 else r, f, g:= $0..2;
while f<=n do r:= r+(f-1)!*b(n-f)*
binomial(n-1, f-1); f, g:= g, f+g
od; r fi
end:
a:= n-> add(b(j)*n^(n-j)*binomial(n-1, j-1), j=0..n):
seq(a(n), n=0..20);
-
b[n_] := b[n] = Module[{r, f, g}, If[n == 0, 1, {r, f, g} = {0, 1, 2}; While[f <= n, r = r + (f - 1)!*b[n - f]*Binomial[n - 1, f - 1]; {f, g} = {g, f + g}]; r]];
a[0] = 1; a[n_] := Sum[b[j]*n^(n - j)*Binomial[n - 1, j - 1], {j, 0, n}];
Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Jun 06 2018, from Maple *)
A273996
Number of endofunctions on [n] whose cycle lengths are factorials.
Original entry on oeis.org
1, 1, 4, 25, 218, 2451, 33952, 560407, 10750140, 235118665, 5775676496, 157448312649, 4716609543736, 154007821275595, 5443783515005760, 207093963680817511, 8436365861409555728, 366403740283162634193, 16900793597898691865920, 825115046704241167668025
Offset: 0
-
b:= proc(n) option remember; local r, f, g;
if n=0 then 1 else r, f, g:= $0..2;
while f<=n do r:= r+(f-1)!*b(n-f)*
binomial(n-1, f-1); f, g:= f*g, g+1
od; r fi
end:
a:= n-> add(b(j)*n^(n-j)*binomial(n-1, j-1), j=0..n):
seq(a(n), n=0..20);
-
b[n_] := b[n] = Module[{r, f, g}, If[n == 0, 1, {r, f, g} = {0, 1, 2}; While[f <= n, r = r + (f - 1)!*b[n - f]*Binomial[n - 1, f - 1]; {f, g} = {f*g, g + 1}]; r]];
a[0] = 1; a[n_] := Sum[b[j]*n^(n - j)*Binomial[n - 1, j - 1], {j, 0, n}];
Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Jun 06 2018, from Maple *)
A273998
Number of endofunctions on [n] whose cycle lengths are primes.
Original entry on oeis.org
1, 0, 1, 8, 75, 904, 13255, 229536, 4587961, 103971680, 2634212961, 73787255200, 2264440519891, 75563445303072, 2724356214102055, 105546202276277504, 4373078169296869425, 192970687573630633216, 9035613818754820178689, 447469496697658409400960
Offset: 0
-
b:= proc(n) option remember; local r, p;
if n=0 then 1 else r, p:=0, 2;
while p<=n do r:= r+(p-1)!*b(n-p)*
binomial(n-1, p-1); p:= nextprime(p)
od; r fi
end:
a:= n-> add(b(j)*n^(n-j)*binomial(n-1, j-1), j=0..n):
seq(a(n), n=0..20);
-
b[n_] := b[n] = Module[{r, p}, If[n == 0, 1, {r, p} = {0, 2}; While[p <= n, r = r + (p - 1)!*b[n - p]*Binomial[n-1, p-1]; p = NextPrime[p]]; r]];
a[0] = 1; a[n_] := Sum[b[j]*n^(n - j)*Binomial[n - 1, j - 1], {j, 0, n}];
Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Jun 06 2018, from Maple *)
Showing 1-4 of 4 results.
Comments