Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117403
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117403 Antidiagonal sums of triangle A117401: a(n) = Sum_{k=0..[n/2]} 2^((n-2*k)*k) for n>=0. +0
3
1, 1, 2, 3, 6, 13, 34, 105, 386, 1681, 8706, 53793, 395266, 3442753, 35659778, 440672385, 6476038146, 112812130561, 2336999211010, 57759810847233, 1697654543745026, 59146046307566593, 2450521284684021762 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: A(x) = Sum_{n>=0} x^n/(1-2^n*x^2). a(2*n) = Sum_{k=0..n} 4^((n-k)*k); a(2*n+1) = Sum_{k=0..n} 2^k*4^((n-k)*k).

EXAMPLE

A(x) = 1/(1-x^2) + x/(1-2x^2) + x^2/(1-4x^2) + x^3/(1-8x^2) + ...

PROGRAM

(PARI) a(n)=sum(k=0, n\2, 2^((n-2*k)*k))

CROSSREFS

Cf. A117401 (triangle), A117402 (row sums).

Sequence in context: A005554 A077212 A076836 this_sequence A002877 A065845 A137273

Adjacent sequences: A117400 A117401 A117402 this_sequence A117404 A117405 A117406

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Mar 12 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research