login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074225 a(n) = n * Sum_{d|n} d*2^(d-1). 1
1, 10, 39, 148, 405, 1254, 3143, 8488, 20853, 52050, 123915, 297804, 692237, 1611974, 3687795, 8405584, 18939921, 42512562, 94634003, 209819940, 462431697, 1015269486, 2218786839, 4832458392, 10485762025, 22684180610, 48922424415, 105229923596 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Colin Barker, Table of n, a(n) for n = 1..1000

N. J. A. Sloane and Thomas Wieder, The Number of Hierarchical Orderings, arXiv:math/0307064 [math.CO], 2003.

N. J. A. Sloane and Thomas Wieder, The Number of Hierarchical Orderings, Order 21 (2004), 83-89.

MATHEMATICA

a[n_] := n*DivisorSum[n, #*2^(#-1)&]; Array[a, 30] (* Jean-Fran├žois Alcover, Dec 03 2015 *)

PROG

(PARI) vector(100, n, n*sumdiv(n, d, d*2^(d-1))) \\ Colin Barker, Jan 29 2015

CROSSREFS

Equals n*A083413(n).

Sequence in context: A059722 A267748 A229325 * A055514 A055233 A267626

Adjacent sequences:  A074222 A074223 A074224 * A074226 A074227 A074228

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jun 15 2003

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 27 20:33 EDT 2021. Contains 346308 sequences. (Running on oeis4.)