Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131045
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131045 Binomial transform of Euler's totient function phi(n+1). +0
1
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; listen)
OFFSET

0,2

FORMULA

a(n)=Sum(binom(n,j)phi(j+1),j=0..n). - Emeric Deutsch (deutsch(AT)duke.poly.edu), 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 (deutsch(AT)duke.poly.edu), Jul 09 2007

CROSSREFS

Cf. A000010, A007318.

Sequence in context: A162036 A062422 A079864 this_sequence A026721 A094975 A067687

Adjacent sequences: A131042 A131043 A131044 this_sequence A131046 A131047 A131048

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 11 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 09 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research