Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069751
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069751 Smallest k>n such that floor((1.1)^k)/floor((1.1)^n) is an integer. +0
1
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; listen)
OFFSET

1,1

PROGRAM

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

CROSSREFS

Adjacent sequences: A069748 A069749 A069750 this_sequence A069752 A069753 A069754

Sequence in context: A034894 A061430 A065448 this_sequence A115060 A004840 A032994

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research