Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050167
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050167 T(n,k)=M(n,k,f(n,k)), 0<=k<=n, n >= 0, array M as in A050144, and f(n,k)=least number t for which M(n,k,t) is not 0. +0
1
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 3, 2, 5, 4, 1, 1, 4, 5, 5, 9, 5, 1, 1, 5, 9, 5, 14, 14, 6, 1, 1, 6, 14, 14, 14, 28, 20, 7, 1, 1, 7, 20, 28, 14, 42, 48, 27, 8, 1, 1, 8, 27, 48, 42, 42, 90, 75, 35, 9, 1, 1, 9, 35, 75, 90, 42, 132, 165, 110, 44 (list; table; graph; listen)
OFFSET

0,9

COMMENT

f(n,k)=-1 if 0<=k<=[ (n-1)/2 ], f(n,k)=2k-n if [ (n+1)/2 ]+1<=k<=n.

EXAMPLE

Rows: {1}; {1,1}; {1,1,1}; {1,1,2,1}, ...

CROSSREFS

Adjacent sequences: A050164 A050165 A050166 this_sequence A050168 A050169 A050170

Sequence in context: A092332 A092334 A047060 this_sequence A047050 A057820 A054012

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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research