login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A163894 The least i for which A163355^n(i) is not equal to i, 0 if no such i exists, i.e. when A163355^n = A001477. 6
0, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 33, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 76, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 33, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 76, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 33, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 390, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4, 2, 33, 2, 4, 2, 4, 2, 24, 2, 4, 2, 4 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

A163355^n means n-fold application of A163355, i.e. A163355^2 = A163905, A163355^3 = A163915. By convention A163355^0 = A001477.

LINKS

A. Karttunen, Table of n, a(n) for n = 0..4095

PROG

(MIT Scheme:)

(define (A163894 n) (if (zero? n) 0 (let loop ((i 1) (nth_power (compose-fun-to-nth-power a163355 n))) (cond ((not (= i (nth_power i))) i) (else (loop (1+ i) nth_power))))))

(define (compose-fun-to-nth-power fun n) (cond ((zero? n) (lambda (x) x)) (else (lambda (x) (fun ((compose-fun-to-nth-power fun (- n 1)) x))))))

CROSSREFS

See A163890, A163895, A163896.

Sequence in context: A031883 A086152 A194577 * A032059 A074075 A184186

Adjacent sequences:  A163891 A163892 A163893 * A163895 A163896 A163897

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Sep 19 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 05:32 EST 2012. Contains 205860 sequences.