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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A338433 Values of n for which A070939(n^3) differs from A004221(n). 2
 1, 20, 40, 80, 101, 126, 127, 159, 160, 161, 200, 201, 202, 203, 252, 253, 254, 255, 317, 318, 319, 320, 321, 322, 399, 400, 401, 402, 403, 404, 405, 406, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sequence gives the values of n for which the length of the binary representation of n^3 differs from ceiling(10*log_10(n)) rounded up. The largest number not in the sequence is 158489319246111348520210137339 = floor(10^29.2). - Robert Israel, Oct 27 2020 LINKS Jeremy Gardiner, Table of n, a(n) for n = 1..1083 Index entries for linear recurrences with constant coefficients, signature (2,-1). MAPLE filter:= n -> evalb(ilog2(n^3)+1 <> ceil(10*log[10](n))): select(filter, [\$1..1000]); # Robert Israel, Oct 27 2020 MATHEMATICA Select[Range[1000], IntegerLength[#^3, 2] != Ceiling[10*Log10[#]] &] (* Amiram Eldar, Oct 27 2020 *) CROSSREFS Cf. A004221, A070939, A111393, A329193. Sequence in context: A061830 A235282 A270296 * A347368 A041790 A041788 Adjacent sequences: A338430 A338431 A338432 * A338434 A338435 A338436 KEYWORD nonn AUTHOR Jeremy Gardiner, Oct 27 2020 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 4 21:02 EST 2022. Contains 358570 sequences. (Running on oeis4.)