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 A044187 #13 Jul 02 2022 13:34:28
%S A044187 64,128,192,256,320,384,448,512,576,640,704,768,832,896,960,1024,1088,
%T A044187 1152,1216,1280,1344,1408,1472,1536,1600,1664,1728,1792,1856,1920,
%U A044187 1984,2048,2112,2176,2240,2304,2368,2432,2496,2560
%N A044187 Numbers n such that string 0,0 occurs in the base 8 representation of n but not of n-1.
%C A044187 Every element is a multiple of 64. The smallest positive multiple of 64 not in the sequence is 4160. - _David W. Wilson_, Aug 03 2005
%H A044187 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a>
%t A044187 SequencePosition[Table[If[SequenceCount[IntegerDigits[n,8],{0,0}]>0,1,0],{n,3000}],{0,1}][[All,2]] (* _Harvey P. Dale_, Jul 02 2022 *)
%K A044187 nonn,base
%O A044187 1,1
%A A044187 _Clark Kimberling_