id:A130535 - OEIS Search Results

Search: id:A130535

Displaying 1-1 of 1 results found.

page 1

a(0)=a(1)=1. a(n+2) = a(floor[(n+1)/a(n+1)]) + a(floor[n/a(n)]).

+0
1

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; listen)

	OFFSET	`0,3`
	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 (deutsch(AT)duke.poly.edu), Aug 13 2007`
	CROSSREFS	`Sequence in context: A072302 A116513 A122651 this_sequence A026819 A046155 A137214` `Adjacent sequences: A130532 A130533 A130534 this_sequence A130536 A130537 A130538`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Aug 09 2007`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 13 2007`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research