Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058922
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058922 n*2^n - 2^n. +0
5
0, 4, 16, 48, 128, 320, 768, 1792, 4096, 9216, 20480, 45056, 98304, 212992, 458752, 983040, 2097152, 4456448, 9437184, 19922944, 41943040, 88080384, 184549376, 385875968, 805306368, 1677721600, 3489660928, 7247757312 (list; graph; listen)
OFFSET

1,2

COMMENT

A hierarchical sequence (S(W'2{2}*c) - see A059126).

a(n)=-det(M(n+1)) where M(n) is the n X n matrix with m(i,i)=1, m(i,j)=-i/j for i != j. - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 01 2003

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,200

J. Wallgren, Hierarchical sequences

FORMULA

With offset 0, this is 4n*2^(n-1), the binomial transform of 4n. - Paul Barry (pbarry(AT)wit.ie), May 20 2003

a(1)=0, a(n)=2*a(n-1)+2^n for n>1 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 20 2009]

PROGRAM

(PARI) { for (n = 1, 200, write("b058922.txt", n, " ", n*2^n - 2^n); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 24 2009]

CROSSREFS

A001787(n) = a(n+1)/4. A073346(n, n-2) = a(n-2).

Sequence in context: A071009 A131126 A159964 this_sequence A034918 A119003 A119005

Adjacent sequences: A058919 A058920 A058921 this_sequence A058923 A058924 A058925

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2001

page 1

Search completed in 0.003 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research