Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047666 Square array a(n,k) read by antidiagonals: a(n,1)=n, a(1,k)=k, a(n,k)=a(n-1,k-1)+a(n-1,k)+a(n,k-1). +0
5
1, 2, 2, 3, 5, 3, 4, 10, 10, 4, 5, 17, 25, 17, 5, 6, 26, 52, 52, 26, 6, 7, 37, 95, 129, 95, 37, 7, 8, 50, 158, 276, 276, 158, 50, 8, 9, 65, 245, 529, 681, 529, 245, 65, 9, 10, 82, 360, 932, 1486, 1486, 932, 360, 82, 10, 11, 101, 507, 1537, 2947, 3653 (list; table; graph; listen)
OFFSET

1,2

FORMULA

T(n, m)=Sum{1 <= i <= n-m}[(2*i+1)*U(n-i-1, m-1)] + Sum{1 <= i <= m} [(2*i+1)*U(n-2, m-i)] - U(n-2, m-1) with U(n, m)=A008288(n, m). - Floor van Lamoen (fvlamoen(AT)hotmail.com), Aug 16 2001

MAPLE

A047666 := proc(n, k) option remember; if n = 1 then k; elif k = 1 then n; else A047666(n-1, k-1)+A047666(n, k-1)+A047666(n-1, k); fi; end;

CROSSREFS

Main diagonal is A002002. Rows give A002522, A047667, A047668, ...

Sequence in context: A014430 A124727 A125101 this_sequence A067330 A132403 A113167

Adjacent sequences: A047663 A047664 A047665 this_sequence A047667 A047668 A047669

KEYWORD

nonn,tabl,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research