id:A137735 - OEIS Search Results

Search: id:A137735

Displaying 1-1 of 1 results found.

page 1

a(0)=1. a(n) = floor(n/b(n)), where b(n) is the largest value among (a(0),a(1),...,a(n-1)).

+0
2

1, 1, 2, 1, 2, 2, 3, 2, 2, 3, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 5, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`For all m>=1, a(k) = m if m^2 <= k <= m^2 +m-1, a(m^2 +m) = m+1, a(k) = m if m^2 +m+1 <= k <= m^2 +2m.`
	EXAMPLE	`The largest value among terms a(0) through a(14) is 4. So a(15) = floor(15/4) = 3.`
	CROSSREFS	`Cf. A137734.` `Sequence in context: A033265 A096004 A071068 this_sequence A143966 A029363 A033922` `Adjacent sequences: A137732 A137733 A137734 this_sequence A137736 A137737 A137738`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Feb 09 2008`

page 1

Search completed in 0.002 seconds

Last modified December 3 01:16 EST 2008. Contains 151161 sequences.

AT&T Labs Research