[go: up one dir, main page]

login
Revision History for A352200 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(0)=0, a(1)=1; thereafter, a(n) is the smallest number m not yet in the sequence such that the binary expansions of m and a(n-1) have a 1 in the same position, but the positions of the 1's in the binary expansions of m and a(n-2) are disjoint, except that the second condition is ignored if it would imply that no choice for m were possible.
(history; published version)
#22 by N. J. A. Sloane at Sun Mar 27 05:57:33 EDT 2022
STATUS

editing

approved

#21 by N. J. A. Sloane at Sun Mar 27 05:57:31 EDT 2022
KEYWORD

nonn,new,base

STATUS

approved

editing

#20 by N. J. A. Sloane at Sat Mar 26 11:23:00 EDT 2022
STATUS

editing

approved

#19 by N. J. A. Sloane at Sat Mar 26 11:22:57 EDT 2022
LINKS

N. J. A. Sloane, <a href="/A352200/b352200.txt">Table of n, a(n) for n = 0..10000</a>

EXTENSIONS

Under construction do not touch

STATUS

approved

editing

#18 by N. J. A. Sloane at Sat Mar 26 10:58:55 EDT 2022
STATUS

editing

approved

#17 by N. J. A. Sloane at Sat Mar 26 10:58:53 EDT 2022
LINKS

N. J. A. Sloane, <a href="/A352200/a352200.txt">Maple program</a>

MAPLE

See link.

STATUS

approved

editing

#16 by N. J. A. Sloane at Sat Mar 26 10:42:16 EDT 2022
STATUS

editing

approved

#15 by N. J. A. Sloane at Sat Mar 26 10:42:13 EDT 2022
NAME

a(0)=0, a(1)=1, a(2)=3; thereafter, a(n) is the smallest number m not yet in the sequence such that the binary expansions of m and a(n-1) have a 1 in the same position, but the positions of the 1's in the binary expansions of m and a(n-2) are disjoint, except that the second condition is ignored if it would imply that no choice for m were possible.

COMMENTS

The second condition is ignored precisely when every prime that divides the positions of the 1's in a(n-1) also divides are a subset of the 1's in a(n-2).

EXAMPLE

a(0)=0, and a(1)=1=1_2, a(2)=3=11_2 are given.

a(3) = 2 ) = 3 = 10_11_2 is disjoint from a(10) and intersects a(1).

a(3) = 2 = 10_2 is the smallest possible value disjoint from a(1) and does not lead to intersects a contradiction(2).

a(2)=3=11_2 Now there is the smallest value no choice for a(4) that satisfies the meets both conditions. It does not lead to , so we ignore the no-intersection-with-a(n-2) condition, and take a contradiction(4) = 6 = 110_2.

a(3)=2=10_2 is the smallest value that satisfies the conditions, but then there is no choice for a(4). a(3)=6=110_2 is the next possibility, and does not lead to a contradiction.

a(4)=100_2 is the smallest value that satisfies the conditions, but then there is no choice for a(5). But a(4)=12=1100_2 works, and does not lead to a contradiction.

#14 by N. J. A. Sloane at Sat Mar 26 10:35:12 EDT 2022
EXAMPLE

a(0)=0, a(1)=1=1_2, a(2)=3=11_2 are given.

a(3) = 2 = 10_2 is disjoint from a(1) and intersects

is the smallest possible value and does not lead to a contradiction.

a(2)=3=11_2 is the smallest value that satisfies the conditions. It does not lead to a contradiction.

a(3)=2=10_2 is the smallest value that satisfies the conditions, but then there is no choice for a(4). a(3)=6=110_2 is the next possibility, and does not lead to a contradiction.

a(4)=100_2 is the smallest value that satisfies the conditions, but then there is no choice for a(5). But a(4)=12=1100_2 works, and does not lead to a contradiction.

STATUS

approved

editing

#13 by N. J. A. Sloane at Sat Mar 26 10:28:12 EDT 2022
STATUS

editing

approved