login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159068 a(n) = Sum_{k=1..n} binomial(n,k) * gcd(k,n). 5
1, 4, 9, 24, 35, 138, 133, 528, 855, 2550, 2057, 12708, 8203, 45178, 78645, 182816, 131087, 933966, 524305, 3698220, 4890627, 13345794, 8388629, 67390440, 60129575, 225470518, 279938133, 1032462228, 536870939, 5018059170 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Each term of the sum a(n) is divisible by n, so a(n) is a multiple of n for all positive integers n.

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..1000

Laszlo Toth, Weighted gcd-sum functions, J. Integer Sequences, 14 (2011), Article 11.7.7. [Notice that formula (26) contains error.]

FORMULA

a(n) = 2^n * Sum_{d|n} (phi(d)/d) Sum_{k=1..d} (-1)^(k*n/d)*cos(k*Pi/d)^n - n.

EXAMPLE

Row 6 of Pascal's triangle is: 1,6,15,20,15,6,1. The greatest common divisors of n and each integer from 1 to 6 are: GCD(1,6)=1, GCD(2,6)=2, GCD(3,6)=3, GCD(4,6)=2, GCD(5,6)=1, and GCD(6,6)=6. So a(6) = 6*1 + 15*2 + 20*3 + 15*2 + 6*1 + 1*6 = 138. Note that each term of the sum is a multiple of 6, so 138 is a multiple of 6.

MAPLE

A159068 := proc(n) add(binomial(n, k)*gcd(k, n), k=1..n) ; end: seq(A159068(n), n=1..80) ; # R. J. Mathar, Apr 06 2009

CROSSREFS

Cf. A159069.

Sequence in context: A270461 A046422 A286729 * A255876 A158141 A056575

Adjacent sequences:  A159065 A159066 A159067 * A159069 A159070 A159071

KEYWORD

nonn

AUTHOR

Leroy Quet, Apr 04 2009

EXTENSIONS

Extended by R. J. Mathar, Apr 06 2009

Formula corrected by Max Alekseyev, Jan 09 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 24 11:29 EDT 2017. Contains 286975 sequences.