Find the n , k term of matrix of Gilbreath 's conjecture
static int Gilbreath ( Dictionary < int , Dictionary < int , int > > mp , Dictionary < int , Dictionary < int , int > > hash , int n , int k ) { if ( hash . ContainsKey ( n ) && hash [ n ] . ContainsKey ( k ) && hash [ n ] [ k ] != 0 ) return mp [ n ] [ k ] ;