The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A368131 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A368131

a(n) = floor(n * log(4/3) / log(3/2))
(history; published version)

#70 by N. J. A. Sloane at Mon Jan 29 19:26:07 EST 2024

STATUS

proposed

approved

#69 by Kevin Ryde at Sun Jan 28 01:09:20 EST 2024

STATUS

editing

proposed

Discussion

Sun Jan 28

06:47

Ruud H.G. van Tol: I really like that it now almost looks as if it was generated by a robot. :) I assume that sequence pages like this (easy) one will soon be partly/mostly generated (with some human touch where desired).

Mon Jan 29

00:33

Kevin Ryde: Can imagine that.  Mechanical checks could be a first step.  (Human taste might be needed for what combinations are interesting!)

08:58

Ruud H.G. van Tol: Also to make the job of the editors lighter. But my view is as biased as anyone's on this, the way I use OEIS is likely less representative than I assume. Generating more parts of sequence pages, with plugins, and with a clear distinction that it is generated, and with a simple way to hide it from view, seems a neat project.

#68 by Kevin Ryde at Sun Jan 28 01:08:59 EST 2024

FORMULA

A054414a(n) = aA325913(n) + 2*- n + 1.

a(n) = A117630(n) = a(n) + - 2*n.

A325913a(n) = aA054414(n) + - 2*n - 1.

CROSSREFS

Cf. A054414, A117630, A325913, A369522 (slope).

KEYWORD

nonn,easy,changed

STATUS

proposed

editing

#67 by Ruud H.G. van Tol at Sat Jan 27 21:15:57 EST 2024

STATUS

editing

proposed

Discussion

Sat Jan 27

21:17

Ruud H.G. van Tol: Like this, or does it need more?

#66 by Ruud H.G. van Tol at Sat Jan 27 21:13:35 EST 2024

NAME

Highest k with 3^(n+k) <= 4^n * 2^k.

a(n) = floor(n * log(4/3) / log(3/2))

COMMENTS

Highest k with 3^(n+k) <= 4^n * 2^k.

FORMULA

a(n) = floor(n * log(4/3) / log(3/2)).

STATUS

proposed

editing

#65 by James C. McMahon at Sat Jan 27 10:41:07 EST 2024

STATUS

editing

proposed

Discussion

Sat Jan 27

19:29

Kevin Ryde: I thought the NAME versus FORMULA were better the way you started, with the name as the floor of slope form.

19:31

Kevin Ryde: Formulas usually should be a(n) = something.  The opposite way might go in the other respective sequences.

20:54

Ruud H.G. van Tol: Re. Formulae: I put a(n) at the right side for some, mainly because of offset differences, as some have offset 1. Less brittle if any offset ever becomes 0.

21:03

Ruud H.G. van Tol: Re. NAME change: I presumed this NAME was more canonical, more appealing, actually more useful as an entry. But (as always) feel free to edit. As a user of OEIS myself, I'm just happy with any detail and tangent on the page, so I aimed at maximising that.

#64 by James C. McMahon at Sat Jan 27 10:39:53 EST 2024

MATHEMATICA

Table[Floor[n*Log[4/3]/Log[3/2]], {n, 0, 68}] (* James C. McMahon, Jan 27 2024 *)

STATUS

proposed

editing

#63 by Jon E. Schoenfield at Sat Jan 27 08:54:17 EST 2024

STATUS

editing

proposed

Discussion

Sat Jan 27

09:09

Ruud H.G. van Tol: Okay!

#62 by Jon E. Schoenfield at Sat Jan 27 08:54:09 EST 2024

PROG

(PARI) alist(N) = my(a=-1, b=1, k=0); vector(N, i, a+=2; b*=3; if(logint(b, 2) < a, a++; b*=3; k++); k); \\ mind note that i is n+1

STATUS

proposed

editing

Discussion

Sat Jan 27

08:54

Jon E. Schoenfield: Okay?

#61 by Ruud H.G. van Tol at Sat Jan 27 08:40:33 EST 2024

STATUS

editing

proposed