login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081875 a(n) = Sum_{d|n} phi(n/d)*C(2*d,d)/2. 0

%I #21 May 07 2021 10:17:21

%S 1,4,12,40,130,480,1722,6480,24336,92520,352726,1352640,5200312,

%T 20060040,77559060,300546720,1166803126,4537592928,17672631918,

%U 68923357200,269128940724,1052049834616,4116715363822,16123803207552

%N a(n) = Sum_{d|n} phi(n/d)*C(2*d,d)/2.

%H V. A. Liskovets, <a href="https://doi.org/10.37236/1841">Enumerative formulas for unrooted planar maps: a pattern</a>, Electron. J. Combin., 11:1 (2004), R88.

%H J. Malenfant, <a href="http://arxiv.org/abs/1502.06012">On the Matrix-Element Expansion of a Circulant Determinant</a>, arXiv preprint arXiv:1502.06012 [math.NT], 2015.

%F Dirichlet convolution of A000010 and A088218. - _R. J. Mathar_, Mar 11 2017

%F a(n) ~ 2^(2*n-1) / sqrt(Pi*n). - _Vaclav Kotesovec_, Jun 08 2019

%F From _Richard L. Ollerton_, May 07 2021: (Start)

%F a(n) = Sum_{k=1..n} C(2*gcd(n,k),gcd(n,k))/2.

%F a(n) = Sum_{k=1..n} A088218(gcd(n,k)). (End)

%e G.f. = x + 4*x^2 + 12*x^3 + 40*x^4 + 130*x^5 + 480*x^6 + 1722*x^7 + ...

%t Table[Fold[ #1+EulerPhi[n/#2]*Binomial[2#2, #2]/2&, 0, Divisors[n]], {n, 1, 32}]

%t a[ n_] := If[ n < 0, 0, Sum[ Binomial[2 d, d] EulerPhi[n / d], {d, Divisors @ n}] / 2]; (* _Michael Somos_, Nov 01 2014 *)

%o (PARI) {a(n) = if( n<1, 0, sumdiv(n, d, binomial(2*d, d) * eulerphi(n/d)) / 2)}; /* _Michael Somos_, Nov 01 2014 */

%Y Cf. A045630.

%K easy,nonn

%O 1,2

%A _Wouter Meeussen_, Apr 12 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 7 10:18 EDT 2024. Contains 374069 sequences. (Running on oeis4.)