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!)
A091409 a(n) is the smallest m such that A090822(m) = n. 4
1, 3, 9, 220 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
D. C. Gijswijt, Krulgetallen, Pythagoras, 55ste Jaargang, Nummer 3, Jan 2016. (Shows that the sequence is infinite)
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [pdf, ps].
FORMULA
a(n) is about 2^(2^(3^(4^(5^...^(n-1))))).
CROSSREFS
Cf. A090822.
Sequence in context: A062228 A196864 A279834 * A027891 A073889 A332586
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, based on a suggestion from Dion Gijswijt (gijswijt(AT)science.uva.nl), Mar 04 2004
EXTENSIONS
Sequence is infinite but next term, about 10^(10^23.09987) (see A091787), is too large to include.
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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)