1,5

This sequence is similar to A279119 in the sense that here we check for common ones in binary representation and there we check for common prime factors.

By analogy with A275152, this sequence can be seen as a way to tile the first quadrant with fixed disconnected 2-dimensional polyominoes: the (vertical) polyomino corresponding to n is shifted to the right as little as possible so as not to overlap a previous polyomino, and a(n) gives the corresponding number of steps to the right (see illustration in Links section).

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Illustration of the first terms (by way of polyominos)

N. J. A. Sloane and Brady Haran, Amazing Graphs III, Numberphile video (2019).

a(n)=0 iff n belongs to A000079.

a(n)=1 iff n belongs to A164346.

with(Bits):

n:= 100:

l:= []:

g:=[seq(0, i = 0..n-1)]:

for i from 1 to n by 1

do

a:= 0;

while (And(g[a + 1], i)) > 0

do

a++;

end do:

g[a + 1] += i;

l:= [op(l), a];

end do:

print(l); # Reza K Ghazi, Dec 29 2021

n = 100;

l = {};

g = ConstantArray[0, n];

For[i = 0, i < n, i++; a = 0; While[BitAnd[g[[a + 1]], i] > 0, a++];

g[[a + 1]] += i;

l = Append[l, a]];

l (* Reza K Ghazi, Dec 29 2021 *)

(PARI) g = vector(72); for (n=1, #g, a = 0; while (bitand(g[a+1], n)>0, a++); g[a+1] += n; print1 (a", "))

(Python)

n = 100

g = n * [0]

for i in range(1, n + 1):

a = 0

while g[a] & i:

a += 1

g[a] += i

print(a, end=', ') # Reza K Ghazi, Dec 29 2021

Cf. A000079, A164346, A275152, A279119.

Sequence in context: A190886 A257845 A162593 * A011025 A286248 A286247

Adjacent sequences: A279122 A279123 A279124 * A279126 A279127 A279128

nonn,base,look

Rémy Sigrist, Dec 06 2016

approved