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.

 Hints (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
 1, 1, 26, 64324, 44418808968, 16811849850663255376, 5739186280165988958118118964128, 2625335736940471293251942853564104852964163648, 2236038557448505001455717540438942031299017768147674692322230400 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..25 FORMULA a(n) = A316674(n,n). a(n) = A262810(n) * ceiling(2^(n-1)) = A262810(n) * A011782(n). CROSSREFS Main diagonal of A316674. Cf. A011782, A262810. Sequence in context: A209961 A302396 A208186 * A092212 A365983 A265959 Adjacent sequences: A316674 A316675 A316676 * A316678 A316679 A316680 KEYWORD nonn,walk AUTHOR Alois P. Heinz, Jul 10 2018 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.

Last modified May 17 19:53 EDT 2024. Contains 372607 sequences. (Running on oeis4.)