Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117177
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117177 The Shift-Moebius transform of powers of 2. +0
1
1, 1, 2, 5, 12, 25, 57, 115, 240, 484, 996, 1987, 4041, 8071, 16252, 32527, 65292, 130558, 261651, 523271, 1047533, 2095138, 4192255, 8384449, 16773161, 33546227, 67100496, 134201373, 268419000, 536837755, 1073709065, 2147417864 (list; graph; listen)
OFFSET

1,3

COMMENT

See triangle A117165 for the definition of the Shift-Moebius transform.

FORMULA

a(n) = Sum_{k=1,n} A117165(n,k)*2^(k-1).

PROGRAM

(PARI) {a(n)=sum(k=1, n, prod(i=0, n, matrix(n, n, r, c, if(r>=c, if((r+n-i)%(c+n-i)==0, moebius((r+n-i)/(c+n-i)), 0))))[ n, k]*2^(k-1))}

CROSSREFS

Cf. A117165, A117175.

Sequence in context: A122439 A063807 A116715 this_sequence A132977 A027927 A116717

Adjacent sequences: A117174 A117175 A117176 this_sequence A117178 A117179 A117180

KEYWORD

nonn

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be) and Paul D. Hanna (pauldhanna(AT)juno.com), Mar 05 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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research