Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050177
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050177 T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the next-to-least t for which M0(n,k,t) is not 0. +0
1
1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 5, 9, 5, 1, 1, 6, 14, 14, 6, 1, 1, 7, 20, 28, 20, 7, 1, 1, 8, 27, 48, 48, 27, 8, 1, 1, 9, 35, 75, 90, 75, 35, 9, 1, 1, 10, 44, 110, 165, 165, 110, 44, 10, 1, 1, 11, 54, 154, 275, 297, 275, 154, 54, 11, 1, 1, 12, 65, 208, 429, 572, 572 (list; table; graph; listen)
OFFSET

3,5

COMMENT

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

EXAMPLE

Rows: {1}; {1,1}; {1,3,1}; {1,4,4,1}; ... (all palindromes)

CROSSREFS

Sequence in context: A049687 A132735 A028262 this_sequence A013580 A147290 A026670

Adjacent sequences: A050174 A050175 A050176 this_sequence A050178 A050179 A050180

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 December 4 14:15 EST 2008. Contains 151279 sequences.


AT&T Labs Research