This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A338433 #25 Oct 31 2020 12:53:46 %S A338433 1,20,40,80,101,126,127,159,160,161,200,201,202,203,252,253,254,255, %T A338433 317,318,319,320,321,322,399,400,401,402,403,404,405,406,502,503,504, %U A338433 505,506,507,508,509,510,511,631,632,633,634,635,636,637,638,639,640,641,642,643,644,645 %N A338433 Values of n for which A070939(n^3) differs from A004221(n). %C A338433 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. %C A338433 The largest number not in the sequence is 158489319246111348520210137339 = floor(10^29.2). - _Robert Israel_, Oct 27 2020 %H A338433 Jeremy Gardiner, <a href="/A338433/b338433.txt">Table of n, a(n) for n = 1..1083</a> %H A338433 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %p A338433 filter:= n -> evalb(ilog2(n^3)+1 <> ceil(10*log[10](n))): %p A338433 select(filter, [$1..1000]); # _Robert Israel_, Oct 27 2020 %t A338433 Select[Range[1000], IntegerLength[#^3, 2] != Ceiling[10*Log10[#]] &] (* _Amiram Eldar_, Oct 27 2020 *) %Y A338433 Cf. A004221, A070939, A111393, A329193. %K A338433 nonn %O A338433 1,2 %A A338433 _Jeremy Gardiner_, Oct 27 2020