Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026022
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026022 Triangular array T read by rows: T(n,0) = 1 for n >= 0; T(n,k) = C(n,k) for k = 1,2,...,n, for n = 1,2,3; and for n >= 4, T(n,k) = T(n-1,k-1) + T(n-1,k) for k = 1,2,...,[ (n+2)/2 ] and T(n,(n+3)/2) = T(n-1,(n+1)/2) if n is odd. +0
16
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 5, 10, 10, 4, 1, 6, 15, 20, 14, 1, 7, 21, 35, 34, 14, 1, 8, 28, 56, 69, 48, 1, 9, 36, 84, 125, 117, 48, 1, 10, 45, 120, 209, 242, 165, 1, 11, 55, 165, 329, 451, 407, 165, 1, 12, 66, 220, 494, 780, 858, 572, 1, 13, 78, 286, 714, 1274, 1638, 1430, 572 (list; table; graph; listen)
OFFSET

1,5

FORMULA

T(n, k) = C(n, k) - C(n, k-4). - Ralf Stephan, Jan 09 2005

CROSSREFS

Sequence in context: A034328 A034253 A118687 this_sequence A073714 A144151 A022818

Adjacent sequences: A026019 A026020 A026021 this_sequence A026023 A026024 A026025

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research