A130535 a(0)=a(1)=1; a(n+2) = a(floor((n+1)/a(n+1))) + a(floor(n/a(n))).

1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 4, 5, 5, 5, 6, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 6, 7, 7, 6, 7, 7, 7, 8, 7, 7, 8, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

Offset: 0

Author

Leroy Quet, Aug 09 2007

Keywords

• nonn
• look
• easy

Comments

The sequence is unbounded. - Rémy Sigrist, Aug 08 2019

Links

• Rémy Sigrist, Table of n, a(n) for n = 0..10000
• Rémy Sigrist, C program for A130535

Crossrefs

Cf. A130147.

Programs

C

See Links section.

Maple

a[0]:=1: a[1]:=1: for n from 0 to 80 do a[n+2]:= a[floor((n+1)/a[n+1])]+a[floor(n/a[n])] end do: seq(a[n],n=0..80); # Emeric Deutsch, Aug 13 2007

Extensions

More terms from Emeric Deutsch, Aug 13 2007