Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095396
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095396 Modified juggler map: a[n]=(1-Mod[n, 2])*Floor[n^(2/3)]]+Mod[n, 2]*Floor[n^(3/2)], i.e. for even numbers a[n]=n^(2/3) or for odd n, a[n]=sqrt[n^3]. +0
3
1, 1, 5, 2, 11, 3, 18, 4, 27, 4, 36, 5, 46, 5, 58, 6, 70, 6, 82, 7, 96, 7, 110, 8, 125, 8, 140, 9, 156, 9, 172, 10, 189, 10, 207, 10, 225, 11, 243, 11, 262, 12, 281, 12, 301, 12, 322, 13, 343, 13, 364, 13, 385, 14, 407, 14, 430, 14, 453, 15, 476, 15, 500, 16, 524, 16, 548, 16 (list; graph; listen)
OFFSET

1,3

COMMENT

Parallel to A094683: values for odd arguments are same, for even are not necessarily so.

MATHEMATICA

d[x_]:=d[x]=(1-Mod[x, 2])*Floor[N[x^(2/3), 50]] +Mod[x, 2]*Floor[N[x^(3/2), 50]]; d[1]=1; Table[d[w], {w, 1, 150}]

CROSSREFS

Cf. A007320, A094683, A094716, A095397, A097398.

Sequence in context: A111187 A094683 A094685 this_sequence A051308 A074642 A131784

Adjacent sequences: A095393 A095394 A095395 this_sequence A095397 A095398 A095399

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 18 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research