The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A322919 Numbers n such that n and n-1 both first appear in the same power of 2 (in base 10). 1
 59, 74, 111, 785, 793, 914, 957, 985, 1070, 1467, 2019, 2099, 2332, 2610, 2934, 3028, 3083, 3311, 3334, 3973, 4198, 4208, 4334, 4590, 4689, 4785, 5247, 5350, 5535, 6166, 6335, 6669, 6761, 7167, 7340, 7707, 7980, 8668, 8990, 9180, 9840, 11110, 13096, 16285, 17418, 18091, 18361, 19219, 20522, 21494, 21827 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS David A. Corneth, Table of n, a(n) for n = 1..3106 EXAMPLE For instance 2019 is in the sequence since 2018 and 2019 both appear in 2^212 and neither appear in any smaller power of two. PROG (C) #include int main() {   int n = 1000001;  /* Highest term */   int p = 2;        /* Powers of two.  Test throughly if you change it. */   int r = 10;       /* Base ten.  Test throughly if you change it. */   char a[n];   int b, c, i, j, k, k2, l, lk, m, ok, ok2, u, d[7], f[n], g[n], v[n];   u = n;   for (j=0; j-1; l--) {           ok = 1;           for (j=lk-1; j>-1; j--) if (a[l+j] != d[j]) ok = 0;           if (ok) ok2 = 1;         }         if (ok2) {           f[k] = m;           u--;         }       }       if ((g[k]==-1) && (lk<=b+1)) {         ok = 1;         for (j=lk-1; j>-1; j--) if (a[b-lk+j+1] != d[j]) ok = 0;         if (ok) g[k] = m;       }     }     c = 0;     for (j=0; j r-1) {         c = a[j] / r;         a[j] %= r;       }     }   }   for (i=1; i

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

Last modified April 7 04:20 EDT 2020. Contains 333292 sequences. (Running on oeis4.)