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
A049487 Number of maximal-length non-crossing paths on n X n square lattice. +0
2
0, 2, 38, 13, 1674, 790526 (list; graph; listen)
OFFSET

1,2
CROSSREFS

Cf. A049486.

Sequence in context: A083189 A145798 A110762 this_sequence A163792 A050899 A068401

Adjacent sequences: A049484 A049485 A049486 this_sequence A049488 A049489 A049490

KEYWORD

nonn,walk,nice,hard

AUTHOR

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 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.