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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065644 a(n) is the smallest integer k such that floor((3/2)^k)/floor((3/2)^n) is an integer greater than 1. 0
2, 9, 10, 8, 18, 27, 26, 20, 24, 25, 43, 44, 229, 230, 2242, 162, 3776, 2123, 2697, 11517, 207, 1824, 35102, 6767, 6768, 50320, 51815, 1438, 50419, 50420, 51954, 51955 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

a(2) = 9 because floor((3/2)^9)/floor((3/2)^2) = 19 is the smallest integer value > 1 of the form floor((3/2)^k)/floor((3/2)^2).

MATHEMATICA

Array[Block[{k = 2}, While[Nand[# > 1, IntegerQ@ #] &[Floor[(3/2)^k]/Floor[(3/2)^#]], k++]; k] &, 32] (* Michael De Vlieger, Jun 14 2018 *)

PROG

(PARI) { for (n=1, 100, p=0; while ((a=floor((3/2)^p)/floor((3/2)^n)) < 2 || frac(a) > 0, p++); write("b065644.txt", n, " ", p) ) } \\ Harry J. Smith, Oct 25 2009

CROSSREFS

Cf. A002379.

Sequence in context: A014182 A293037 A131463 * A043065 A077214 A167451

Adjacent sequences:  A065641 A065642 A065643 * A065645 A065646 A065647

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Dec 03 2001

EXTENSIONS

Edited by Harry J. Smith, Oct 25 2009

10 more terms from Harry J. Smith, Oct 25 2009

Edited by Jon E. Schoenfield, Jun 14 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 02:33 EST 2019. Contains 320200 sequences. (Running on oeis4.)