A069751 Smallest k>n such that floor((11/10)^k)/floor((11/10)^n) is an integer.

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 13, 14, 19, 16, 22, 18, 25, 20, 36, 28, 23, 45, 40, 36, 44, 50, 35, 36, 37, 54, 55, 56, 139, 71, 43, 74, 123, 75, 63, 65, 113, 139, 140, 139, 132, 133, 85, 100, 178, 148, 376, 98, 234, 139, 1277, 234, 223, 95, 217, 128, 479, 139, 454

Offset

1,1

Links

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

Mathematica

kln[n_]:=Module[{k=n+1}, While[!IntegerQ[Floor[(11/10)^k]/Floor[(11/10)^n]], k++]; k]; Array[kln, 70] (* Harvey P. Dale, Aug 29 2012 *)

Prog

(PARI) q=1.1; for(s=1, 80, n=s+1; while(frac(floor(q^n)/floor(q^s))>0, n++); print1(n, ", "); )

Crossrefs

See A215975 for the integers that arise.

Sequence in context: A107322 A194975 A299441 * A198323 A254649 A261293

Adjacent sequences: A069748 A069749 A069750 * A069752 A069753 A069754

Keyword

easy,nonn

Author

Benoit Cloitre, May 01 2002

Extensions

Definition clarified by Harvey P. Dale, Aug 29 2012

Status

approved