|
Search: id:A065643
|
|
|
| A065643 |
|
Smallest integer value > 1 of the form floor((3/2)^p)/floor((3/2)^n). |
|
+0
1
|
|
| 2, 19, 19, 5, 211, 5165, 2228, 133, 443, 443, 433936, 433936, 108917231519162597338417004866966084630, 108917231519162597338417004866966084630
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(3)= 19 because floor((3/2)^9/floor(3/2)^3) = 19 is the smallest integer value > 1 of the form floor((3/2)^p)/floor(3/2)^3)
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,19
|
|
PROGRAM
|
(PARI) { for (n=1, 19, p=0; while ((a=floor((3/2)^p)/floor((3/2)^n)) < 2 || frac(a) > 0, p++); write("b065643.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 25 2009]
|
|
CROSSREFS
|
Cf. A002379
Sequence in context: A128361 A096481 A153653 this_sequence A038031 A132129 A125611
Adjacent sequences: A065640 A065641 A065642 this_sequence A065644 A065645 A065646
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 03 2001
|
|
EXTENSIONS
|
Next term is too large to include.
|
|
|
Search completed in 0.002 seconds
|
