The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284523 a(1) = a(2) = 1, a(3) = 2; a(n) = a(a(n-1)-1) + a(n-a(n-3)-1) for n > 3. 4
 1, 1, 2, 2, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 6, 8, 8, 8, 8, 8, 8, 8, 8, 9, 11, 13, 13, 13, 11, 13, 13, 13, 13, 13, 13, 13, 13, 14, 16, 19, 21, 19, 16, 14, 16, 17, 21, 21, 21, 21, 19, 21, 21, 21, 21, 21, 21, 21, 21, 22, 24, 27, 32, 29, 26, 24, 21, 29, 27, 34, 34, 27, 27, 29, 34, 34, 34, 29, 27, 29, 32 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 Altug Alkan, Plot for n=0..10^6 MAPLE a:= proc(n) option remember; procname(procname(n-1)-1) + procname(n-procname(n-3)-1) end proc: a(1):= 1: a(2):= 1: a(3):= 2: map(a, [\$1..100]); MATHEMATICA a[1] = a[2] = 1; a[3] = 2; a[n_] := a[n] = a[a[n - 1] - 1] + a[n - a[n - 3] - 1]; Array[a, 81] (* Michael De Vlieger, Mar 28 2017 *) CROSSREFS Cf. A004001, A005185, A055748. Sequence in context: A194343 A071860 A004788 * A034584 A352130 A035430 Adjacent sequences:  A284520 A284521 A284522 * A284524 A284525 A284526 KEYWORD nonn,look AUTHOR Altug Alkan and Robert Israel, Mar 28 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 08:14 EDT 2022. Contains 354124 sequences. (Running on oeis4.)