This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158561 a(n)=((2^n)*((2^n)+1) - (2^(n-1))*((2^(n-1))+1))/2, a(1)=3. 0
 3, 7, 26, 100, 392, 1552, 6176, 24640, 98432, 393472, 1573376, 6292480, 25167872, 100667392, 402661376 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) gives the number of elements with the length of n-digits, base B, in the addition matrix <0;B^n -1> x <0;B^n -1>. a(1)=B*(B+1)/2. a(n)=((B^n)*((B^n)+1) - (B^(n-1))*((B^(n-1))+1))/2. Essentially the same as A049775. [From R. J. Mathar, Mar 26 2009] LINKS Index to sequences with linear recurrences with constant coefficients, signature (6,-8) FORMULA x*(1-x)*(3-8*x)/((1-2*x)*(1-4*x)) [From Jaume Oliver Lafont, Mar 27 2009] CROSSREFS Cf. A000217 Cf. A006516. [From Jaume Oliver Lafont, Mar 27 2009] Sequence in context: A215018 A069738 A057005 * A108217 A120120 A126472 Adjacent sequences:  A158558 A158559 A158560 * A158562 A158563 A158564 KEYWORD easy,nonn AUTHOR Ctibor O. Zizka, Mar 21 2009 STATUS approved

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 May 18 21:01 EDT 2013. Contains 225428 sequences.