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.

Showing 1-2 of 2 results.

A085525 a(n) = n^(2*n + 2).

Original entry on oeis.org

0, 1, 64, 6561, 1048576, 244140625, 78364164096, 33232930569601, 18014398509481984, 12157665459056928801, 10000000000000000000000, 9849732675807611094711841, 11447545997288281555215581184, 15502932802662396215269535105521, 24201432355484595421941037243826176
Offset: 0

Views

Author

N. J. A. Sloane, Jul 05 2003

Keywords

Comments

a(n) is the number of labeled deterministic finite automata with n states, 2 letters, and one start and one accept state. - Anand Jain, Mar 20 2025

Crossrefs

Cf. A070691.

Programs

A134684 n^(n+9).

Original entry on oeis.org

0, 1, 2048, 531441, 67108864, 6103515625, 470184984576, 33232930569601, 2251799813685248, 150094635296999121, 10000000000000000000, 672749994932560009201, 46005119909369701466112
Offset: 0

Views

Author

Zerinvary Lajos, Jan 26 2008

Keywords

Comments

a(n) = A070691(n+9), for n = 1 ... 10. - Michel Marcus, Aug 15 2013

Crossrefs

Cf. A070691.

Programs

Showing 1-2 of 2 results.