id:A081288 - OEIS Search Results

Search: id:A081288

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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

	OFFSET	`0,2`
	COMMENT	`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 this_sequence A130256 A103586 A117806` `Adjacent sequences: A081285 A081286 A081287 this_sequence A081289 A081290 A081291`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (Firstname.Surname(AT)iki.fi) Mar 17 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research