login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069751 Smallest k>n such that floor((1.1)^k)/floor((1.1)^n) is an integer. 0
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

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

Sequence in context: A061430 A065448 A194975 * A198323 A177872 A115060

Adjacent sequences:  A069748 A069749 A069750 * A069752 A069753 A069754

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 01 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:14 EST 2012. Contains 205792 sequences.