login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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; text; 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) (n-th_power (compose-fun-to-n-th-power a163355 n))) (cond ((not (= i (n-th_power i))) i) (else (loop (1+ i) n-th_power))))))

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

CROSSREFS

See A163890, A163895, A163896.

Sequence in context: A274708 A280638 A333725 * A307095 A032059 A074075

Adjacent sequences:  A163891 A163892 A163893 * A163895 A163896 A163897

KEYWORD

nonn

AUTHOR

Antti Karttunen, Sep 19 2009

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 September 17 16:32 EDT 2021. Contains 347487 sequences. (Running on oeis4.)