login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130535 a(0)=a(1)=1; a(n+2) = a(floor((n+1)/a(n+1))) + a(floor(n/a(n))). 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

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

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

PROG

(C) See Links section.

CROSSREFS

Cf. A130147.

Sequence in context: A122651 A343378 A300013 * A329194 A210533 A246435

Adjacent sequences:  A130532 A130533 A130534 * A130536 A130537 A130538

KEYWORD

nonn,look,easy

AUTHOR

Leroy Quet, Aug 09 2007

EXTENSIONS

More terms from Emeric Deutsch, Aug 13 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 06:10 EDT 2021. Contains 343146 sequences. (Running on oeis4.)