login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308087 Number of lattice paths from (0,0) to (n,n) using Euclid's orchard as a step-set. 3
1, 1, 1, 3, 13, 45, 153, 515, 1767, 6167, 21697, 76661, 271973, 968561, 3460677, 12399661, 44534647, 160285049, 577949447, 2087375443, 7550053527, 27344761057, 99155777619, 359943568005, 1307923066305, 4756914915657, 17315390737219, 63077564876055 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..575

J. East and N. C. Ham, Lattice paths and submonoids of Z^2, arXiv:1811.05735 [math.CO], 2018.

N. C. Ham, Implementation of algorithms 1-3 from J. East and N. C. Ham reference above.

Wikipedia, Euclid's orchard

FORMULA

a(n) mod 2 = 1. - Alois P. Heinz, May 13 2019

a(n) ~ c * d^n / sqrt(n), where d = 3.7137893481485186502229788321701955452444... and c = 0.133597878112414800677299372849715598093... - Vaclav Kotesovec, May 24 2019

MAPLE

b:= proc(x, y) option remember; `if`(y=0, 1, add(add(`if`(1=

      igcd(h, v), b(sort([x-h, y-v])[]), 0), v=1..y), h=1..x))

    end:

a:= n-> b(n$2):

seq(a(n), n=0..30);  # Alois P. Heinz, May 12 2019

CROSSREFS

Cf. A001764, A005043, A005165, A035343, A067955, A097609, A308112, A308113.

Sequence in context: A187915 A115128 A140420 * A232231 A121136 A239592

Adjacent sequences:  A308084 A308085 A308086 * A308088 A308089 A308090

KEYWORD

nonn,walk

AUTHOR

Nicholas Ham, May 11 2019

EXTENSIONS

a(16)-a(27) from Alois P. Heinz, May 12 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 03:40 EST 2019. Contains 329310 sequences. (Running on oeis4.)