The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A094683

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

A094683

Juggler sequence: if n mod 2 = 0 then floor(sqrt(n)) else floor(n^(3/2)).
(history; published version)

#54 by Michel Marcus at Sat Sep 28 12:05:06 EDT 2024

STATUS

editing

proposed

Discussion

Sat Sep 28

12:43

Stefano Spezia: In my opinion, the new formula is a duplicate of Name

20:40

Kevin Ryde: It's both shorter and clearer to say the cases instead of bring out a root of unity like *(-1)^n to select.

20:42

Kevin Ryde: If you particularly wanted an expression then wouldn't it be easier to pick the exponent 1/2 vs 1+1/2 as the point of difference?

#53 by Michel Marcus at Sat Sep 28 12:05:02 EDT 2024

FORMULA

a(n) = (floor(sqrt(n))+floor(n*sqrt(n))+(floor(sqrt(n))-floor(n*sqrt(n)))*(-1)^n)/2. - Aaron J Grech, Sep 28 2024

STATUS

proposed

editing

#52 by Aaron J Grech at Sat Sep 28 11:35:15 EDT 2024

STATUS

editing

proposed

#51 by Aaron J Grech at Sat Sep 28 11:35:12 EDT 2024

FORMULA

a(n)=(floor(sqrt(n))+floor(n*sqrt(n))+(floor(sqrt(n))-floor(n*sqrt(n)))*(-1)^n)/2. - Aaron J Grech, Sep 28 2024

STATUS

approved

editing

#50 by Alois P. Heinz at Fri Feb 18 19:19:52 EST 2022

STATUS

proposed

approved

#49 by Chai Wah Wu at Fri Feb 18 13:15:10 EST 2022

STATUS

editing

proposed

#48 by Chai Wah Wu at Fri Feb 18 13:15:02 EST 2022

PROG

(Python)

from math import isqrt

def A094683(n): return isqrt(n**3 if n % 2 else n) # Chai Wah Wu, Feb 18 2022

STATUS

approved

editing

#47 by Peter Luschny at Mon Jun 08 05:31:23 EDT 2020

STATUS

reviewed

approved

#46 by Joerg Arndt at Mon Jun 08 03:30:09 EDT 2020

STATUS

proposed

reviewed

#45 by Michel Marcus at Mon Jun 08 03:27:16 EDT 2020

STATUS

editing

proposed