login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A356516 a(n) is the least k such that A356515(k) = n. 1
0, 1, 3, 31, 9007199254740991 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
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.
LINKS
FORMULA
a(n) = A356517(2, A356517(3, ... A356517(n, n) ...)) for n > 1.
EXAMPLE
For n = 4:
- A356517(4, 4) = 7,
- A356517(3, 7) = 53,
- A356517(2, 53) = 9007199254740991,
- so a(4) = 9007199254740991.
PROG
(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 }
CROSSREFS
Sequence in context: A367038 A317482 A136582 * A173649 A210648 A119937
KEYWORD
nonn,base,bref
AUTHOR
Rémy Sigrist, Aug 10 2022
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:22 EDT 2024. Contains 371954 sequences. (Running on oeis4.)