Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068052
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A068052
%S A068052 1,3,15,119,1799,59367,3743271,481693095,123123509927,62989418816679,
%T A068052 64491023022979239,132015402419352060071,540829047855347718631591,
%U A068052 4430403202865824763042320551,72583450474242118015031400337575
%N A068052 Start from 1, shift one left and sum mod 2 (bitwise-XOR) to get 3 (11 
               in binary), then shift two steps left and XOR to get 15 (1111 in 
               binary), then three steps and XOR to get 119 (1110111 in binary), 
               then four steps and so on. Sequence A068053 converted to decimal.
%p A068052 with(gfun,seriestolist); [seq(foo(map(`mod`,seriestolist(series(mul(1+(z^i),
               i=1..n),z,binomial(n+1,2)+1)),2)), n=0..20)];
%p A068052 foo := proc(a) local i; add(a[i]*2^(i-1),i=1..nops(a)); end;
%Y A068052 a(n) = each row of A053632 reduced mod 2 and interpreted as a binary 
               number. Same sequence in binary: A068053.
%Y A068052 Sequence in context: A145161 A121422 A060639 this_sequence A068859 A006454 
               A112228
%Y A068052 Adjacent sequences: A068049 A068050 A068051 this_sequence A068053 A068054 
               A068055
%K A068052 nonn
%O A068052 0,2
%A A068052 Antti Karttunen, Feb 13 2002

    
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research