This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000799 a(n) = floor(2^n / n). (Formerly M0239 N0082) 21
 2, 2, 2, 4, 6, 10, 18, 32, 56, 102, 186, 341, 630, 1170, 2184, 4096, 7710, 14563, 27594, 52428, 99864, 190650, 364722, 699050, 1342177, 2581110, 4971026, 9586980, 18512790, 35791394, 69273666, 134217728, 260301048, 505290270, 981706810, 1908874353 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..300 MAPLE seq(floor(2^n/n), n=1..40); # Muniru A Asiru, Oct 20 2018 MATHEMATICA Table[Quotient[2^n, n], {n, 60}] (* Vladimir Joseph Stephan Orlovsky, May 07 2011 *) PROG (PARI) a(n)=1<Int(2^n/n)); # Muniru A Asiru, Oct 20 2018 (Python) for n in range(1, 40): print(int(2**n / n), end=", ") # Stefano Spezia, Oct 20 2018 CROSSREFS Cf. A000801, A053638, A065482, A082482, A071354. Sequence in context: A060827 A188288 A064355 * A185030 A063823 A182027 Adjacent sequences:  A000796 A000797 A000798 * A000800 A000801 A000802 KEYWORD nonn,easy AUTHOR 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 14 04:44 EDT 2019. Contains 327995 sequences. (Running on oeis4.)