id:A137734 - OEIS Search Results

Search: id:A137734

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 5, 4, 4, 4, 5, 5, 5, 5, 5, 6, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; listen)

	OFFSET	`0,3`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	FORMULA	`For all m>=2, a(k) = m if m^2-m+1 <= k <= m^2, a(m^2 +1) = m+1, a(k) = m if m^2 +2 <= k <= m^2 +m.`
	EXAMPLE	`The largest value among terms a(0) through a(12) is 4. So a(13) = ceiling(13/4) = 4.`
	CROSSREFS	`Cf. A137735.` `Sequence in context: A128330 A133801 A112310 this_sequence A078705 A050331 A128435` `Adjacent sequences: A137731 A137732 A137733 this_sequence A137735 A137736 A137737`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet Feb 09 2008`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research