login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055895 Inverse Moebius transform of powers of 2. 3
1, 2, 6, 10, 22, 34, 78, 130, 278, 522, 1062, 2050, 4190, 8194, 16518, 32810, 65814, 131074, 262734, 524290, 1049654, 2097290, 4196358, 8388610, 16781662, 33554466, 67117062, 134218250, 268451990, 536870914, 1073775726 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

N. J. A. Sloane, Transforms

FORMULA

G.f.: sum(k>=1, 1/(1-2*x^k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 21 2003

G.f.: sum(k>=1, 2^k*x^k/(1-x^k)). - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 21 2003

a(n) = sum( 2^d, d divides n) - Olivier Gérard, Jan 01, 2012

MATHEMATICA

Table[Plus @@ Map[Function[d, 2^d], Divisors[n]], {n, 0, 30}] (* Olivier Gérard, Jan 01, 2012 *)

PROG

(PARI) a(n)=if(n<1, 0, polcoeff(sum(k=1, n, 1/(1-2*x^k), x*O(x^n)), n))

CROSSREFS

Cf. A055894.

Sequence in context: A034168 A055745 A167512 * A125527 A200572 A049750

Adjacent sequences:  A055892 A055893 A055894 * A055896 A055897 A055898

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jun 09 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.