The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063892 a(1) = a(2) = a(3) = 1, a(n) = a(n-a(n-2))+a(n-a(n-3)) for n>3. 6
 1, 1, 1, 2, 4, 6, 5, 3, 3, 9, 6, 4, 7, 12, 9, 5, 7, 10, 16, 16, 10, 12, 12, 16, 14, 21, 13, 17, 8, 14, 24, 26, 19, 12, 8, 23, 22, 23, 12, 17, 18, 28, 35, 26, 16, 22, 34, 47, 22, 6, 10, 36, 69, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Undefined for n>54 since a(53)=69>=55. LINKS EXAMPLE a(7) = a(7-a(5))+a(7-a(4)) = a(7-4)+a(7-2) = a(3)+a(5) = 1+4 = 5. MAPLE #Q(r, s) with initial values 1, 1, 1, ..., from N. J. A. Sloane, Apr 15 2014 r:=2; s:=3; a:=proc(n) option remember; global r, s; if n <= s then 1 else     if (a(n-r) <= n) and (a(n-s) <= n) then     a(n-a(n-r))+a(n-a(n-s));     else lprint("died with n =", n); return (-1);     fi; fi; end; [seq(a(n), n=1..54)]; CROSSREFS Cf. A005185, A046700, A063882, A226222. See A064714 for a variant which does not die. Sequence in context: A242796 A298527 A071288 * A254763 A023825 A022485 Adjacent sequences:  A063889 A063890 A063891 * A063893 A063894 A063895 KEYWORD fini,full,nonn AUTHOR Henry Bottomley, Aug 29 2001 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.

Last modified June 5 16:19 EDT 2020. Contains 334852 sequences. (Running on oeis4.)