Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091409
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091409 a(n) = smallest m such that A090822(m) = n. +0
2
1, 3, 9, 220 (list; graph; listen)
OFFSET

1,2

LINKS

F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. 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 A. R. 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

Sequence in context: A078590 A061963 A062228 this_sequence A027891 A073889 A132516

Adjacent sequences: A091406 A091407 A091408 this_sequence A091410 A091411 A091412

KEYWORD

nonn,bref

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research