cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A277736 Positions of 0's in A277735.

This page as a plain text file.
%I A277736 #9 Nov 07 2016 11:22:05
%S A277736 1,4,5,6,8,10,13,14,17,18,21,22,23,25,28,29,30,32,35,36,37,39,41,44,
%T A277736 45,48,49,50,52,54,57,58,61,62,63,65,67,70,71,74,75,78,79,80,82,85,86,
%U A277736 87,89,91,94,95,98,99,102,103,104,106,109,110,111,113,115,118,119,122,123,126,127,128,130,133,134
%N A277736 Positions of 0's in A277735.
%C A277736 {A277736, A277737, A277738} forms a three-way partition of the positive integers, similar to {A003144, A003145, A003146}.
%H A277736 N. J. A. Sloane, <a href="/A277736/b277736.txt">Table of n, a(n) for n = 1..20000</a>
%p A277736 with(ListTools);
%p A277736 T:=proc(S) Flatten(subs( {0=[0,1], 1=[2,0], 2=[0]}, S)); end;
%p A277736 S:=[0];
%p A277736 for n from 1 to 14 do S:=T(S); od:
%p A277736 S; # A277735
%p A277736 p0:=[]: p1:=[]: p2:=[]:
%p A277736 for i from 1 to nops(S) do
%p A277736 j:=S[i];
%p A277736 if j=0 then p0:=[op(p0),i];
%p A277736 elif j=1 then p1:=[op(p1),i];
%p A277736 else p2:=[op(p2),i]; fi: od:
%p A277736 p0; # A277736
%p A277736 p1; # A277737
%p A277736 p2: # A277738
%Y A277736 Cf. A277735, A277737, A277738.
%Y A277736 Cf. also A003144, A003145, A003146.
%K A277736 nonn
%O A277736 1,2
%A A277736 _N. J. A. Sloane_, Nov 07 2016