Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050178
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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; listen)
OFFSET

5,5

COMMENT

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: A144221 A159570 A028313 this_sequence A111720 A029646 A152721

Adjacent sequences: A050175 A050176 A050177 this_sequence A050179 A050180 A050181

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


AT&T Labs Research