id:A081882 - OEIS Search Results

Search: id:A081882

Displaying 1-1 of 1 results found.

page 1

Number of steps needed to reach an integer starting with n-1/4 and iterating the map x ->x*ceiling(x).

+0
1

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

	OFFSET	`2,1`
	FORMULA	`It seems that sum(k=2, n, a(k)) is asymptotic to 3n`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=n-1/4; c=0; while(frac(s)>0, s=s*ceil(s); c++); c)`
	CROSSREFS	`Cf. A068119.` `Sequence in context: A021360 A028256 A024544 this_sequence A100064 A120026 A109089` `Adjacent sequences: A081879 A081880 A081881 this_sequence A081883 A081884 A081885`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 13 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research