A081288 - OEIS

This site is supported by donations to The OEIS Foundation.

A081288

a(n) = minimal i such that A000108(i) > n.

0, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`Apart from the initial term 0, each n occurs A000245(n-1) times.`
	CROSSREFS	`Cf. A072643, A081289, A081290. Used to compute A081291.` `Sequence in context: A130193 A084516 A084526 * A130256 A103586 A194847` `Adjacent sequences: A081285 A081286 A081287 * A081289 A081290 A081291`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (Firstname.Surname(AT)iki.fi) Mar 17 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.