login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A255420
Ludic recurrence: Iterates of f(n) = A003309(n+1) starting from n=1.
3
1, 2, 3, 5, 11, 37, 181, 1361, 13927, 183871, 3005533, 59045717
OFFSET
0,2
FORMULA
a(0) = 1; for n >= 1: a(n) = A003309(1+a(n-1)).
Other identities. For all n >= 0:
a(n) = A237126(A000225(n+1)).
a(n) = A255421(A007097(n)).
PROG
(Scheme, with memoization-macro definec)
(definec (A255420 n) (if (zero? n) 1 (A003309 (+ 1 (A255420 (- n 1))))))
(Haskell)
a255420 n = a255420_list !! n
a255420_list = iterate (a003309 . (+ 1)) 1
-- Reinhard Zumkeller, Feb 25 2015
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Antti Karttunen, Feb 23 2015
STATUS
approved