proposed
approved
proposed
approved
editing
proposed
Antti Karttunen, <a href="/A105203/b105203.txt">Table of n, a(n) for n = 0..19682</a>
a(0) = 1; and for n > 1, a(n) = A105202(n+A003462(1+A062153(n))). - Antti Karttunen, Aug 12 2017
(Scheme) (define (A105203 n) (if (zero? n) 1 (A105202 (+ n (A003462 (+ 1 (A062153 n))))))) ;; Antti Karttunen, Aug 12 2017
approved
editing
editing
approved
<a href="/index/Fi#FIXEDPOINTS">Index entries for sequences that are fixed points of mappings</a>
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
F. M. Dekking, Recurrent Sets, Advances in Mathematics, vol. 44, no. 1, 1982, page 96, section 4.10
F. M. Dekking, <a href="http://dx.doi.org/10.1016/0001-8708(82)90066-4">Recurrent sets</a>, Advances in Mathematics, vol. 44, no. 1 (1982), 78-104; page 96, section 4.10.
Nest[ Flatten[ # /. {1 -> {1, 2, 1}, 2 -> {2, 3, 2}, 3 -> {3, 1, 3}}] &, {1}, 5] (from _* _Robert G. Wilson v_, Apr 12 2005 *)
approved
editing