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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050178 T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the 3rd-from-least t for which M0(n,k,t) is not 0. 0
1, 1, 1, 1, 5, 1, 1, 6, 6, 1, 1, 7, 20, 7, 1, 1, 8, 27, 27, 8, 1, 1, 9, 35, 75, 35, 9, 1, 1, 10, 44, 110, 110, 44, 10, 1, 1, 11, 54, 154, 275, 154, 54, 11, 1, 1, 12, 65, 208, 429, 429, 208, 65, 12, 1, 1, 13, 77, 273, 637, 1001, 637, 273, 77, 13, 1, 1, 14, 90, 350, 910 (list; table; graph; refs; listen; history; internal format)
OFFSET

5,5

COMMENTS

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

EXAMPLE

Rows: {1}; {1,1}; {1,5,1}; {1,6,6,1}; ... (all palindromes)

CROSSREFS

Sequence in context: A159570 A028313 A173119 * A171146 A174038 A200401

Adjacent sequences:  A050175 A050176 A050177 * A050179 A050180 A050181

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 14 09:18 EST 2012. Contains 205614 sequences.