Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065568 Sum over all subsets of {1,..,n} of the GCD of the subset. +0
2
1, 4, 10, 22, 42, 84, 154, 298, 568, 1108, 2142, 4254, 8362, 16636, 33076, 66004, 131556, 262974, 525136, 1050016, 2098756, 4196962, 8391288, 16782312, 33559612, 67118176, 134227594, 268453714, 536889198, 1073777718, 2147519572 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

a(n)=Sum[Plus @@ GCD @@@ KSubsets[Range[n], m], {m, n}] or a(n)=Table[Sum[Plus@@(EulerPhi[Divisors[k]] 2^(k/Divisors[k]))/2, {k, n}], {n, 42}]

CROSSREFS

Row sums of A065567, first differences equal A034738,

Sequence in context: A023609 A055364 A032191 this_sequence A007825 A008256 A006001

Adjacent sequences: A065565 A065566 A065567 this_sequence A065569 A065570 A065571

KEYWORD

nonn

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be), Nov 30 2001

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