A284511 a(1) = 1, a(2) = 2, a(3) = 2; a(n) = a(a(n-1)-1) + a(n-a(n-2)) for n > 3.

1, 2, 2, 3, 4, 4, 4, 5, 7, 8, 7, 7, 8, 8, 8, 9, 12, 14, 12, 11, 15, 15, 13, 14, 15, 15, 15, 16, 16, 16, 16, 17, 21, 23, 23, 23, 23, 23, 24, 25, 26, 27, 27, 27, 29, 28, 29, 27, 26, 28, 30, 30, 29, 30, 31, 31, 31, 31, 32, 32, 32, 32, 32, 33, 38, 44, 43, 41, 40, 40, 40, 41, 46, 50

Offset

1,2

Links

Altug Alkan, Table of n, a(n) for n = 1..20000

Altug Alkan, Scatterplot of A284511

Altug Alkan, Scatterplot of 2*a(n)-n

Formula

a(n) = a(a(n-1)-1) + a(n-a(n-2)), with a(1) = 1, a(2) = 2, a(3) = 2.

Example

a(4) = 3 because a(4) = a(a(3) - 1) + a(4 - a(2)) = a(1) + a(2) = 3.

Maple

a:= proc(n) option remember;
  procname(procname(n-1)-1)+procname(n-procname(n-2))
end proc:
a(1):= 1: a(2):= 2: a(3):= 2:
map(a, [$1..100]); # Robert Israel, Mar 28 2017

Mathematica

a[1]=1; a[2]=a[3]=2; a[n_] := a[n] = a[a[n-1]-1] + a[n-a[n-2]]; Array[a, 74] (* Giovanni Resta, Mar 28 2017 *)

Prog

(PARI) a=vector(1000); a[1]=1; a[2]=a[3]=2; for(n=4, #a, a[n]=a[a[n-1]-1]+a[n-a[n-2]]); a
(Sage)
@CachedFunction
def a(n): # A284511
    if (n<4): return 2 - bool(n==1)
    else: return  a(a(n-1)-1) + a(n-a(n-2))
[a(n) for n in (1..80)] # G. C. Greubel, Mar 28 2022

Crossrefs

Cf. A004001, A005185, A005229, A055748, A070867, A226222.

Sequence in context: A131807 A104351 A366274 * A262976 A349608 A224709

Adjacent sequences: A284508 A284509 A284510 * A284512 A284513 A284514

Keyword

nonn

Author

Altug Alkan, Mar 28 2017

Status

approved