Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135416
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A135416
%S A135416 1,0,2,0,0,0,4,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,
               0,
%T A135416 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,
               0,
%U A135416 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A135416 A036987(n)*(n+1)/2.
%C A135416 Guy Steele defines a family of 36 integer sequences, denoted here by 
               GS(i,j) for 1 <= i, j <= 6, as follows. a[1]=1; a[2n] = i-th term 
               of {0,1,a[n],a[n]+1,2a[n],2a[n]+1}; a[2n+1] = j-th term of {0,1,a[n],
               a[n]+1,2a[n],2a[n]+1}. The present sequence is GS(1,5).
%C A135416 The full list of 36 sequences:
%C A135416 GS(1,1) = A000007
%C A135416 GS(1,2) = A000035
%C A135416 GS(1,3) = A036987
%C A135416 GS(1,4) = A007814
%C A135416 GS(1,5) = A135416 (the present sequence)
%C A135416 GS(1,6) = A135481
%C A135416 GS(2,1) = A135528
%C A135416 GS(2,2) = A000012
%C A135416 GS(2,3) = A000012
%C A135416 GS(2,4) = A091090
%C A135416 GS(2,5) = A135517
%C A135416 GS(2,6) = A135521
%C A135416 GS(3,1) = A036987
%C A135416 GS(3,2) = A000012
%C A135416 GS(3,3) = A000012
%C A135416 GS(3,4) = A000120
%C A135416 GS(3,5) = A048896
%C A135416 GS(3,6) = A038573
%C A135416 GS(4,1) = A135523
%C A135416 GS(4,2) = A001511
%C A135416 GS(4,3) = A008687
%C A135416 GS(4,4) = A070939
%C A135416 GS(4,5) = A135529
%C A135416 GS(4,6) = A135533
%C A135416 GS(5,1) = A048298
%C A135416 GS(5,2) = A006519
%C A135416 GS(5,3) = A080100
%C A135416 GS(5,4) = A087808
%C A135416 GS(5,5) = A053644
%C A135416 GS(5,6) = A000027
%C A135416 GS(6,1) = A135534
%C A135416 GS(6,2) = A038712
%C A135416 GS(6,3) = A135540
%C A135416 GS(6,4) = A135542
%C A135416 GS(6,5) = A054429
%C A135416 GS(6,6) = A003817
%e A135416 GS:=proc(i,j,M) local a,n; a:=array(1..2*M+1); a[1]:=1;
%e A135416 for n from 1 to M do
%e A135416 a[2*n] :=[0,1,a[n],a[n]+1,2*a[n],2*a[n]+1][i];
%e A135416 a[2*n+1]:=[0,1,a[n],a[n]+1,2*a[n],2*a[n]+1][j];
%e A135416 od: a:=convert(a,list); RETURN(a); end;
%e A135416 GS(1,5,200):
%Y A135416 Sequence in context: A132349 A123391 A076260 this_sequence A134309 A051516 
               A127391
%Y A135416 Adjacent sequences: A135413 A135414 A135415 this_sequence A135417 A135418 
               A135419
%K A135416 nonn
%O A135416 1,3
%A A135416 N. J. A. Sloane (njas(AT)research.att.com), based on a message from Guy 
               Steele and D. E. Knuth, Mar 01 2008

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research