Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065567
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065567 T(n,m) is the sum over all m-subsets of {1,..,n} of the GCD of the subset. +0
2
1, 3, 1, 6, 3, 1, 10, 7, 4, 1, 15, 11, 10, 5, 1, 21, 20, 21, 15, 6, 1, 28, 26, 36, 35, 21, 7, 1, 36, 38, 60, 71, 56, 28, 8, 1, 45, 50, 90, 127, 126, 84, 36, 9, 1, 55, 67, 132, 215, 253, 210, 120, 45, 10, 1, 66, 77, 177, 335, 463, 462, 330, 165, 55, 11, 1, 78, 105, 250, 512 (list; table; graph; listen)
OFFSET

1,2

COMMENT

First differences of row sums equals A034738.

EXAMPLE

1; 3,1; 6,3,1; 10,7,4,1; 15,11,10,5,1; ...

T(4,2)=7 since GCD[1,2] + GCD[1,3] + GCD[1,4] + GCD[2,3] + GCD[2,4] + GCD[3,4] = 7.

MATHEMATICA

Table[Plus@@(GCD@@@KSubsets[Range[n], m]), {n, 16}, {m, n}]

CROSSREFS

Cf. A065568, A034738.

Adjacent sequences: A065564 A065565 A065566 this_sequence A065568 A065569 A065570

Sequence in context: A122432 A131110 A133093 this_sequence A100861 A131031 A130452

KEYWORD

nonn,tabl

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research