The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A192121 Monotonic ordering of nonnegative differences 8^i - 2^j, for 40 >= i >= 0, j >= 0. 4
 0, 4, 6, 7, 32, 48, 56, 60, 62, 63, 256, 384, 448, 480, 496, 504, 508, 510, 511, 2048, 3072, 3584, 3840, 3968, 4032, 4064, 4080, 4088, 4092, 4094, 4095, 16384, 24576, 28672, 30720, 31744, 32256, 32512, 32640, 32704, 32736, 32752, 32760, 32764, 32766, 32767 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Nathaniel Johnston, Table of n, a(n) for n = 1..2461 [truncated to 8^40-1 by Georg Fischer, Nov 16 2021] MAPLE A192121:={}: for i from 0 to 5 do for j from 0 to 3*i do A192121 := A192121 union {8^i-2^j}: od: od: op(A192121); # Nathaniel Johnston, Jun 23 2011 MATHEMATICA c = 8; d = 2; t[i_, j_] := c^i - d^j; u = Table[t[i, j], {i, 0, 40}, {j, 0, i*Log[d, c]}]; v = Union[Flatten[u ]] CROSSREFS Cf. A192110, A192120. Sequence in context: A019251 A102134 A102133 * A012760 A333742 A107648 Adjacent sequences: A192118 A192119 A192120 * A192122 A192123 A192124 KEYWORD nonn,easy,fini AUTHOR Clark Kimberling, Jun 23 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 22:36 EST 2023. Contains 367616 sequences. (Running on oeis4.)