login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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; refs; listen; history; internal format)
OFFSET

0,9

COMMENTS

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

Sequence in context: A092332 A092334 A047060 * A047050 A205028 A057820

Adjacent sequences:  A050164 A050165 A050166 * A050168 A050169 A050170

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 February 16 04:47 EST 2012. Contains 205860 sequences.