Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102688
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102688 a(n) = (1/n)*Sum_{k=1..n} k*2^gcd(n,k). +0
1
2, 5, 10, 20, 36, 74, 134, 272, 526, 1052, 2058, 4160, 8204, 16466, 32824, 65696, 131088, 262490, 524306, 1049168, 2097316, 4195358, 8388630, 16779632, 33554516, 67112996, 134218282, 268443848, 536870940, 1073759432, 2147483678 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = (A000079(n)+n*A000031(n))/2.

MATHEMATICA

f[n_] := Sum[k*2^GCD[n, k], {k, n}]/n; Table[ f[n], {n, 32}] (from Robert G. Wilson v Feb 12 2005)

CROSSREFS

Adjacent sequences: A102685 A102686 A102687 this_sequence A102689 A102690 A102691

Sequence in context: A121597 A000712 A032442 this_sequence A001629 A068034 A084215

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 03 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 12 2005

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 May 17 13:36 EDT 2008. Contains 139908 sequences.


AT&T Labs Research