id:A163894 - OEIS Search Results

Search: id:A163894

Displaying 1-1 of 1 results found.

page 1

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.

+0
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; listen)

	OFFSET	`0,2`
	COMMENT	`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`
	PROGRAM	`(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: A128886 A031883 A086152 this_sequence A032059 A074075 A004020` `Adjacent sequences: A163891 A163892 A163893 this_sequence A163895 A163896 A163897`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Sep 19 2009`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research