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!)
A085119 a(n) = number at which the Ackermann function mod n stabilizes. 0
1, 1, 1, 1, 1, 1, 5, 2, 1, 1, 1, 9, 13, 13, 13, 13, 13, 2, 13, 13, 17, 13, 13, 5, 13, 13, 13, 22, 13, 5, 29, 1, 13, 13, 13, 29, 13, 13, 13, 7, 13, 1, 17, 13, 29, 1, 13, 1, 33, 49, 13, 20, 31, 11, 13, 11, 3, 19, 13, 19, 61, 13, 61, 13, 61, 27, 49, 10, 13, 40, 13, 34, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,7

COMMENTS

a(1969) is undefined, but otherwise a(n) is defined for all n >= 2 and < 4000000.

LINKS

Table of n, a(n) for n=2..74.

J. Froemke and J. W. Grossman, A mod-n Ackermann function, or what's so special about 1969?, Amer. Math. Monthly, 100 (1993), 180-183.

J. W. Grossman, Home page

CROSSREFS

Sequence in context: A338945 A263007 A104714 * A010128 A348993 A180133

Adjacent sequences:  A085116 A085117 A085118 * A085120 A085121 A085122

KEYWORD

nonn

AUTHOR

Jerrold Grossman, Apr 25 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 17:18 EST 2022. Contains 350455 sequences. (Running on oeis4.)