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.

A369277 Distinct values of A369317, in order of appearance.

Original entry on oeis.org

1, 3, 7, 5, 15, 9, 31, 21, 11, 13, 63, 17, 51, 127, 85, 33, 73, 255, 27, 45, 511, 65, 341, 23, 107, 29, 19, 189, 195, 25, 1023, 273, 69, 81, 455, 129, 585, 79, 93, 819, 207, 121, 243, 2047, 1365, 279, 635, 443, 889, 465, 4095, 257, 1419, 1677, 1057, 313, 1335
Offset: 1

Views

Author

Rémy Sigrist, Jan 20 2024

Keywords

Comments

All terms are even.
This sequence is infinite as it contains A126646.
Will every odd number appear in the sequence?
Empirically, each odd number, say v, appears in A369317, and the first index is of the form v*2^k - 1 for some k > 0 (see Example section).

Examples

			The first terms, alongside their index m in A369317, in decimal and in binary, are:
  n   a(n)  m     bin(a(n))  bin(m)
  --  ----  ----  ---------  ------------
   1     1     1          1             1
   2     3     5         11           101
   3     7    27        111         11011
   4     5    39        101        100111
   5    15   119       1111       1110111
   6     9   287       1001     100011111
   7    31   495      11111     111101111
   8    21   671      10101    1010011111
   9    11   703       1011    1010111111
  10    13   831       1101    1100111111
  11    63  2015     111111   11111011111
  12    17  2175      10001  100001111111
		

Crossrefs

Programs

  • PARI
    See Links section.