A355413 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A355413

Lexicographically earliest infinite sequence of positive numbers such that, for n>1, a(n) AND a(n-1) is distinct from all previous AND operations between adjacent terms, where AND is the binary AND operator.

0, 1, 3, 3, 6, 5, 7, 7, 14, 9, 11, 11, 14, 13, 15, 15, 30, 17, 19, 19, 22, 21, 23, 23, 30, 25, 27, 27, 30, 29, 31, 31, 62, 33, 35, 35, 38, 37, 39, 39, 46, 41, 43, 43, 46, 45, 47, 47, 62, 49, 51, 51, 54, 53, 55, 55, 62, 57, 59, 59, 62, 61, 63, 63, 126, 65, 67, 67, 70, 69, 71, 71, 78, 73, 75, 75

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

Each term must be chosen so that a subsequent term can always been found. This implies, for example, no power of 2 can ever be a term as the result of an AND operation between such a number and any following number will be either 0 or the power of 2, both of which have already appeared as the result of AND operations.

Every a(n) where n is odd is a fixed point.

LINKS

Table of n, a(n) for n=0..75.

Scott R. Shannon, Line graph of the first 100000 terms.

EXAMPLE

a(3) = 3 as a(2) = 3 and 3 AND 3 = 3, which has not occurred earlier for any AND's between adjacent terms. Note that a(3) cannot equal 2 = 10_2 as the result of any subsequent AND operation with 2 would be 0 or 2, both of which have already occurred.

CROSSREFS

Cf. A007088, A129760, A338824.

Sequence in context: A286102 A023822 A318514 * A369857 A071047 A265008

Adjacent sequences: A355410 A355411 A355412 * A355414 A355415 A355416

KEYWORD

nonn,base

AUTHOR

Scott R. Shannon, Jul 01 2022

STATUS

approved