Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049487
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A049487
%S A049487 0,2,38,13,1674,790526
%N A049487 Number of maximal-length non-crossing paths on n X n square lattice.
%Y A049487 Cf. A049486.
%Y A049487 Sequence in context: A083189 A145798 A110762 this_sequence A163792 A050899 
               A068401
%Y A049487 Adjacent sequences: A049484 A049485 A049486 this_sequence A049488 A049489 
               A049490
%K A049487 nonn,walk,nice,hard
%O A049487 1,2
%A A049487 Arlin Anderson (starship1(AT)gmail.com)

    
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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research