cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
0 1
1 1
2 26
3 64324
4 44418808968
5 16811849850663255376
6 5739186280165988958118118964128
7 2625335736940471293251942853564104852964163648
8 2236038557448505001455717540438942031299017768147674692322230400

List of values

[1, 1, 26, 64324, 44418808968, 16811849850663255376, 5739186280165988958118118964128, 2625335736940471293251942853564104852964163648, 2236038557448505001455717540438942031299017768147674692322230400]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.