id:A081849 - OEIS Search Results

Search: id:A081849

Displaying 1-1 of 1 results found.

page 1

Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached.

+0
5

3, 20, 14, 468, 33, 299, 60, 47328, 95, 1218, 138, 25475, 189, 3161, 248, 20830128, 315, 6512, 390, 181138, 473, 11655, 564, 9015167, 663, 18974, 770, 671745, 885, 28853, 1008, 38906570560, 1139, 41676, 1278, 1799888, 1425, 57827, 1580, 110341278, 1743, 77690 (list; graph; listen)

	OFFSET	`1,1`
	MAPLE	`Digits := 100: c := ceil; A081849 := proc(a) local i, t0, t; t0 := a; t := 0; for i from 1 to 100 do if whattype(t0) <> integer then t0 := a*c(t0); t := t+1; else RETURN(t0); fi; od; RETURN('FAIL'); end;`
	CROSSREFS	`A001511 gives number of steps to reach an integer. Cf. A073524, A074078.` `Adjacent sequences: A081846 A081847 A081848 this_sequence A081850 A081851 A081852` `Sequence in context: A084316 A126810 A115280 this_sequence A022129 A109218 A053748`
	KEYWORD	`nonn`
	AUTHOR	`njas, Apr 13 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research