cp's OEIS Frontend

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.

A044187 Numbers n such that string 0,0 occurs in the base 8 representation of n but not of n-1.

Original entry on oeis.org

64, 128, 192, 256, 320, 384, 448, 512, 576, 640, 704, 768, 832, 896, 960, 1024, 1088, 1152, 1216, 1280, 1344, 1408, 1472, 1536, 1600, 1664, 1728, 1792, 1856, 1920, 1984, 2048, 2112, 2176, 2240, 2304, 2368, 2432, 2496, 2560
Offset: 1

Views

Author

Keywords

Comments

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

Programs

  • Mathematica
    SequencePosition[Table[If[SequenceCount[IntegerDigits[n,8],{0,0}]>0,1,0],{n,3000}],{0,1}][[All,2]] (* Harvey P. Dale, Jul 02 2022 *)