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-1 of 1 results.

A356516 a(n) is the least k such that A356515(k) = n.

Original entry on oeis.org

0, 1, 3, 31, 9007199254740991
Offset: 0

Views

Author

Rémy Sigrist, Aug 10 2022

Keywords

Comments

All terms belong to A000225.
a(5) = 2^1235346792567893 - 1 is too large to fit in the data section or in a b-file.

Examples

			For n = 4:
- A356517(4, 4) = 7,
- A356517(3, 7) = 53,
- A356517(2, 53) = 9007199254740991,
- so a(4) = 9007199254740991.

Crossrefs

Cf. A000225, A356515, A356517.

Programs

  • PARI
    A356517(n, k) = { (1+k%(n-1))*n^(k\(n-1))-1 }
a(n) = { my (v=n); forstep (b=n, 2, -1, v=A356517(b,v)); v }

Formula

a(n) = A356517(2, A356517(3, ... A356517(n, n) ...)) for n > 1.
Showing 1-1 of 1 results.

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

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