The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.


(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A316677 Number of paths from {0}^n to {n}^n that always move closer to {n}^n. 3

%I #8 Jul 10 2018 14:34:14

%S 1,1,26,64324,44418808968,16811849850663255376,

%T 5739186280165988958118118964128,

%U 2625335736940471293251942853564104852964163648,2236038557448505001455717540438942031299017768147674692322230400

%N Number of paths from {0}^n to {n}^n that always move closer to {n}^n.

%H Alois P. Heinz, <a href="/A316677/b316677.txt">Table of n, a(n) for n = 0..25</a>

%F a(n) = A316674(n,n).

%F a(n) = A262810(n) * ceiling(2^(n-1)) = A262810(n) * A011782(n).

%Y Main diagonal of A316674.

%Y Cf. A011782, A262810.

%K nonn,walk

%O 0,3

%A _Alois P. Heinz_, Jul 10 2018

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 June 15 03:12 EDT 2024. Contains 373402 sequences. (Running on oeis4.)