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!)
A131045 Binomial transform of Euler's totient function phi(n+1). 2
1, 2, 5, 12, 29, 68, 155, 348, 775, 1712, 3745, 8112, 17431, 37252, 79355, 168710, 358037, 758020, 1599675, 3362876, 7041593, 14692956, 30577435, 63531092, 131901879, 273804738, 568366037, 1179585610, 2446603047, 5068970880 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = Sum_{j=0..n} binomial(n,j)*phi(j+1). - Emeric Deutsch, Jul 09 2007
EXAMPLE
a(3) = (1,3,3,1) dot (1,1,2,2) = 1 + 3 + 6 + 2 = 12.
MAPLE
with(numtheory); a := proc (n) options operator, arrow; sum(binomial(n, j)*phi(j+1), j = 0 .. n) end proc; seq(a(n), n = 0 .. 30); # Emeric Deutsch, Jul 09 2007
MATHEMATICA
Table[Sum[Binomial[n, k]*EulerPhi[k+1], {k, 0, n}], {n, 0, 30}] (* Vaclav Kotesovec, Oct 30 2017 *)
PROG
(PARI) a(n) = sum(j=0, n, binomial(n, j)*eulerphi(j+1)); \\ Michel Marcus, Feb 26 2019
CROSSREFS
Sequence in context: A320553 A266465 A079864 * A182555 A026721 A094975
KEYWORD
nonn
AUTHOR
Gary W. Adamson, Jun 11 2007
EXTENSIONS
More terms from Emeric Deutsch, Jul 09 2007
STATUS
approved

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 August 1 19:22 EDT 2024. Contains 374817 sequences. (Running on oeis4.)