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.

A277738 Positions of 2's in A277735.

This page as a plain text file.
%I A277738 #9 Nov 07 2016 11:33:17
%S A277738 3,12,16,20,27,34,43,47,56,60,69,73,77,84,93,97,101,108,117,121,125,
%T A277738 132,139,148,152,161,165,169,176,183,192,196,205,209,213,220,227,236,
%U A277738 240,249,253,262,266,270,277,286,290,294,301,308,317,321,330,334,343,347,351,358,367,371,375,382,389,398
%N A277738 Positions of 2's in A277735.
%C A277738 {A277736, A277737, A277738} forms a three-way partition of the positive integers, similar to {A003144, A003145, A003146}.
%H A277738 N. J. A. Sloane, <a href="/A277738/b277738.txt">Table of n, a(n) for n = 1..10609</a>
%p A277738 with(ListTools);
%p A277738 T:=proc(S) Flatten(subs( {0=[0,1], 1=[2,0], 2=[0]}, S)); end;
%p A277738 S:=[0];
%p A277738 for n from 1 to 14 do S:=T(S); od:
%p A277738 S; # A277735
%p A277738 p0:=[]: p1:=[]: p2:=[]:
%p A277738 for i from 1 to nops(S) do
%p A277738 j:=S[i];
%p A277738 if j=0 then p0:=[op(p0),i];
%p A277738 elif j=1 then p1:=[op(p1),i];
%p A277738 else p2:=[op(p2),i]; fi: od:
%p A277738 p0; # A277736
%p A277738 p1; # A277737
%p A277738 p2: # A277738
%Y A277738 Cf. A277735, A277736, A277737.
%Y A277738 Cf. also A003144, A003145, A003146.
%K A277738 nonn
%O A277738 1,1
%A A277738 _N. J. A. Sloane_, Nov 07 2016