

A081885


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


0



8, 5, 3, 8, 18, 8, 5, 6, 5, 6, 3, 6, 7, 5, 1, 6, 4, 6, 3, 4, 2, 6, 2, 7, 3, 2, 4, 6, 2, 5, 1, 8, 12, 4, 7, 4, 8, 7, 3, 9, 10, 5, 3, 9, 5, 6, 1, 3, 11, 4, 2, 4, 4, 4, 2, 4, 6, 7, 2, 2, 5, 3, 1, 7, 9, 9, 5, 7, 4, 13, 4, 5, 6, 8, 6, 14, 8, 3, 1, 4, 2, 5, 4, 5, 3, 2, 2, 10, 2, 5, 3, 18, 4, 3, 1, 11, 4, 7, 7, 4, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Conjecture : let b(n,m) denotes the number of steps needed to reach an integer starting with n+1/2^m and iterating the map x>x*ceiling(x); then sum(k=1,n,b(k,m)) is asymptotic to (m+1)*n.


LINKS

Table of n, a(n) for n=1..101.


FORMULA

It seems that sum(k=1, n, a(k)) is asymptotic to 5n.


MATHEMATICA

Table[Length[NestWhileList[# Ceiling[#]&, n+1/16, !IntegerQ[#]&]]1, {n, 110}] (* Harvey P. Dale, Apr 02 2012 *)


PROG

(PARI) a(n)=if(n<0, 0, s=n+1/16; c=0; while(frac(s)>0, s=s*ceil(s); c++); c)


CROSSREFS

Cf. A068119, A073524.
Sequence in context: A200141 A011466 A154509 * A019609 A334502 A093341
Adjacent sequences: A081882 A081883 A081884 * A081886 A081887 A081888


KEYWORD

nonn


AUTHOR

Benoit Cloitre, Apr 13 2003


STATUS

approved



