Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083413
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083413 a(n) = Sum_{d|n} d*2^(d-1) for n > 0. +0
4
0, 1, 5, 13, 37, 81, 209, 449, 1061, 2317, 5205, 11265, 24817, 53249, 115141, 245853, 525349, 1114113, 2361809, 4980737, 10490997, 22020557, 46148613, 96468993, 201352433, 419430481, 872468485, 1811941645, 3758211557, 7784628225, 16106378529, 33285996545 (list; graph; listen)
OFFSET

0,3

LINKS

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

FORMULA

Sum_{n > 0} a(n)*x^n/n = Sum_{m > 0} x^m/(m*(1-2*x^m)).

G.f.: Sum_{m > 0} x^m/(1-2*x^m)^2.

MAPLE

oo := 101: t1 := add(x^m/(m*(1-2*x^m)), m=1..oo): series(%, x, oo): t2 := seriestolist(%): A083413 := n -> t2[n+1]*n;

PROGRAM

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, d*2^(d-1)))

CROSSREFS

Cf. A077272.

Cf. A054599.

Sequence in context: A089523 A058507 A111057 this_sequence A071100 A125734 A129924

Adjacent sequences: A083410 A083411 A083412 this_sequence A083414 A083415 A083416

KEYWORD

nonn

AUTHOR

njas, Jun 09 2003

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research