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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094683 Juggler sequence: if n mod 2 = 0 then floor(sqrt(n)) else floor(n^(3/2)). 20
0, 1, 1, 5, 2, 11, 2, 18, 2, 27, 3, 36, 3, 46, 3, 58, 4, 70, 4, 82, 4, 96, 4, 110, 4, 125, 5, 140, 5, 156, 5, 172, 5, 189, 5, 207, 6, 225, 6, 243, 6, 262, 6, 281, 6, 301, 6, 322, 6, 343, 7, 364, 7, 385, 7, 407, 7, 430, 7, 453, 7, 476, 7, 500, 8, 524, 8, 548, 8, 573, 8, 598, 8, 623, 8, 649 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Interspersion of A000093 and A000196. - Michel Marcus, Nov 11 2013

REFERENCES

C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 233.

LINKS

Karl V. Boddy, Table of n, a(n) for n = 0..10000

H. J. Smith, Juggler Sequence

Eric Weisstein's World of Mathematics, Juggler Sequence

Wikipedia, Juggler sequence

MAPLE

A094683 :=proc(n) if n mod 2 = 0 then RETURN(floor(sqrt(n))) else RETURN(floor(n^(3/2))); end if; end proc;

CROSSREFS

Cf. A007320, A007321, A094684, A094685, A094716.

Cf. A000093, A000196.

Sequence in context: A050004 A111187 A257323 * A094685 A095396 A051308

Adjacent sequences:  A094680 A094681 A094682 * A094684 A094685 A094686

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jun 09 2004

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 21:05 EST 2016. Contains 278955 sequences.