Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124316
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124316 a(n) = Sum_{ d divides n } sigma_1(lcm(d,n/d)), where sigma is the sum of divisors function. +0
2
1, 2, 2, 5, 2, 4, 2, 8, 6, 4, 2, 10, 2, 4, 4, 15, 2, 12, 2, 10, 4, 4, 2, 16, 8, 4, 10, 10, 2, 8, 2, 22, 4, 4, 4, 30, 2, 4, 4, 16, 2, 8, 2, 10, 12, 4, 2, 30, 10, 16, 4, 10, 2, 20, 4, 16, 4, 4, 2, 20, 2, 4, 12, 37, 4, 8, 2, 10, 4, 8, 2, 48, 2, 4, 16, 10, 4, 8, 2, 30, 23, 4, 2, 20, 4, 4, 4, 16, 2, 24 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Table[Plus @@ Map[DivisorSigma[1, GCD[ #, n/# ]] &, Divisors@n], {n, 90}]

CROSSREFS

Cf. A001616, A061884, A124315.

Adjacent sequences: A124313 A124314 A124315 this_sequence A124317 A124318 A124319

Sequence in context: A021448 A108053 A133501 this_sequence A061034 A111861 A004543

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 30 2006

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research