login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A049487
Number of maximal-length non-crossing paths on n X n square lattice.
2
0, 2, 38, 13, 1674, 790526
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,2
LINKS
Table of n, a(n) for n=1..6.
CROSSREFS
Cf.
A049486
.
Sequence in context:
A201556
A284309
A227468
*
A163792
A050899
A068401
Adjacent sequences:
A049484
A049485
A049486
*
A049488
A049489
A049490
KEYWORD
nonn
,
walk
,
nice
,
hard
AUTHOR
Arlin Anderson (starship1(AT)gmail.com)
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)