A130193 a(0)=1. a(n+1) = a(ceiling(n/a(n))) + 1.

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

Offset: 0

Author

Leroy Quet, Aug 05 2007

Keywords

• easy
• nonn

Comments

Records 1,2,3,4,5,... appear at n = 0, 1, 2, 5, 18, 87, 518, 3621,.. which appears to be essentially A094294. - R. J. Mathar, Sep 10 2015

Links

• N. J. A. Sloane, Table of n, a(n) for n = 0..20000

Crossrefs

Cf. A094294, A130147.

Programs

Maple

A130193 := proc(n)
    option remember;
    if n = 0 then
        1;
    else
        1+procname(ceil((n-1)/procname(n-1))) ;
    end if;
end proc:
seq(A130193(n),n=0..50) ; # R. J. Mathar, Sep 10 2015