cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A050167 #5 Mar 30 2012 18:57:01
%S A050167 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,
%T A050167 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,
%U A050167 42,90,75,35,9,1,1,9,35,75,90,42,132,165,110,44
%N 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.
%C A050167 f(n,k)=-1 if 0<=k<=[ (n-1)/2 ], f(n,k)=2k-n if [ (n+1)/2 ]+1<=k<=n.
%e A050167 Rows: {1}; {1,1}; {1,1,1}; {1,1,2,1}, ...
%K A050167 nonn,tabl
%O A050167 0,9
%A A050167 _Clark Kimberling_