login

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”).

A277732
Positions of 0's in A277731.
4
1, 3, 6, 8, 11, 12, 14, 17, 19, 22, 23, 25, 27, 30, 32, 35, 36, 38, 41, 43, 46, 47, 49, 51, 54, 56, 59, 61, 64, 65, 67, 70, 72, 75, 76, 78, 80, 83, 85, 88, 89, 91, 94, 96, 99, 100, 102, 104, 107, 109, 112, 114, 117, 118, 120, 123, 125, 128, 129, 131, 134, 136, 139, 140, 142, 144, 147, 149, 152, 153
OFFSET
1,2
COMMENTS
{A277732, A277733, A277734} forms a three-way partition of the positive integers, similar to {A003144, A003145, A003146}.
LINKS
MAPLE
with(ListTools);
T:=proc(S) Flatten(subs( {0=[0, 1], 1=[0, 1, 2], 2=[0]}, S)); end;
S:=[0];
for n from 1 to 14 do S:=T(S); od:
S; # A277731
p0:=[]: p1:=[]: p2:=[]:
for i from 1 to nops(S) do
j:=S[i];
if j=0 then p0:=[op(p0), i];
elif j=1 then p1:=[op(p1), i];
else p2:=[op(p2), i]; fi: od:
p0; # A277732
p1; # A277733
p2; # A277734
MATHEMATICA
m = 1000; (* number of terms of A277731 *)
S[1] = {0};
S[n_] := S[n] = SubstitutionSystem[{0 -> {0, 1}, 1 -> {0, 1, 2}, 2 -> {0}}, S[n - 1]];
For[n = 2, True, n++, If[PadRight[S[n], m] == PadRight[S[n - 1], m], Print["n = ", n]; Break[]]];
A277731 = Take[S[n], m];
Position[A277731, 0] // Flatten (* Jean-François Alcover, Mar 20 2023 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 07 2016
STATUS
approved