login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A369293 Lexicographically earliest sequence of distinct positive integers such that a(1) = 1, a(2) = 2, and for any n > 1, A091255(a(n), a(n+1)) <> 1. 4
1, 2, 4, 6, 3, 5, 9, 7, 14, 8, 10, 12, 15, 17, 18, 16, 20, 22, 11, 29, 23, 13, 26, 24, 27, 21, 28, 30, 32, 34, 33, 31, 62, 36, 35, 42, 38, 19, 53, 39, 40, 43, 25, 50, 44, 46, 45, 48, 51, 54, 49, 56, 52, 57, 58, 60, 63, 65, 66, 64, 68, 70, 72, 71, 61, 122, 74 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
In other words, the polynomials over GF(2) whose coefficients are encoded in the binary expansions of two consecutive terms (beyond the initial term) are not coprime.
This sequence is a variant of the EKG sequence (A064413).
Is this a permutation of the positive integers?
LINKS
Rémy Sigrist, PARI program
EXAMPLE
The first terms, alongside A091255(a(n), a(n+1)), are:
n a(n) A091255(a(n), a(n+1))
-- ---- ---------------------
1 1 1
2 2 2
3 4 2
4 6 3
5 3 3
6 5 3
7 9 7
8 7 7
9 14 2
10 8 2
PROG
(PARI) See Links section.
CROSSREFS
See A369281 and A369294 for similar sequences.
Sequence in context: A373546 A175213 A346150 * A104492 A331522 A075075
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, Jan 18 2024
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 15 12:15 EDT 2024. Contains 375173 sequences. (Running on oeis4.)