A087159 Satisfies a(1)=1, a(A087160(n+1)) = a(n)+1, with a(m)=2 for all m not found in A087160, where A087160(n+2)=A087160(n+1)+a(n)+1.

1, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 3, 2, 2, 5, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 3, 2, 2, 5, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 3, 2, 2, 6, 2, 2, 2, 2, 2, 3, 2

Offset: 1

Author

Paul D. Hanna, Aug 22 2003

Keywords

• nonn

Comments

Records form A087161: a(A087161(n))=n and satisfy recurrence: A087161(n+3) = 5*A087161(n+2) - 6*A087161(n+1) + 2*A087161(n).

Examples

			Initialize all terms to 2. Set a(1)=1, go one term forward,
set a(2)=a(1)+1=2, go 2 terms forward,
set a(4)=a(2)+1=3, go 3 terms forward,
set a(7)=a(3)+1=3, go 3 terms forward,
set a(10)=a(4)+1=4, go 4 terms forward,
set a(14)=a(5)+1=3, etc.
The indices 1,2,4,7,10,14,... form A087160.
		

Crossrefs

Cf. A087160, A087161.