Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095399
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095399 Modified juggler modified further: a[n]=(1-Mod[n,2])*Floor[n^(3/4)]+Mod[n,2]*Floor[n^(4/3)]; original exponents {1/2,3/2} are replaced with {3/4,4/3}. +0
1
1, 1, 4, 2, 8, 3, 13, 4, 18, 5, 24, 6, 30, 7, 36, 8, 43, 8, 50, 9, 57, 10, 65, 10, 73, 11, 81, 12, 89, 12, 97, 13, 105, 14, 114, 14, 123, 15, 132, 15, 141, 16, 150, 17, 160, 17, 169, 18, 179, 18, 189, 19, 199, 19, 209, 20, 219, 21, 229, 21, 240, 22, 250, 22, 261, 23, 272, 23 (list; graph; listen)
OFFSET

1,3

MATHEMATICA

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

CROSSREFS

Cf. A007320, A094683, A094716, A094396-A094401.

Sequence in context: A065171 A026192 A026142 this_sequence A068504 A080965 A083703

Adjacent sequences: A095396 A095397 A095398 this_sequence A095400 A095401 A095402

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research