a(1) = 2, a(2) = 3; thereafter a(n) = a(n-1) + a(|n-a(T)|), where a(T) is the largest term in the sequence before a(n) such that 0 < |n-a(T)| < n.

A271063

a(1) = 2, a(2) = 3; thereafter a(n) = a(n-1) + a(|n-a(T)|), where a(T) is the largest term in the sequence before a(n) such that 0 < |n-a(T)| < n.

Terms

    a(0) =2a(1) =3a(2) =5a(3) =7a(4) =10a(5) =17a(6) =22a(7) =25a(8) =50a(9) =72a(10) =89a(11) =161a(12) =322a(13) =411a(14) =483a(15) =533a(16) =558a(17) =580a(18) =597a(19) =607a(20) =614a(21) =619a(22) =622a(23) =624a(24) =629a(25) =1253a(26) =1875a(27) =2494a(28) =3108a(29) =3715

External references