Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107681
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A107681
%S A107681 0,1,0,1,3,4,0,1,3,4,9,10,12,13,0,1,3,4,9,10,12,13,27,28,30,31,36,37,39,
%T A107681 4,0,0,1,3,4,9,10,12,13,27,28,30,31,36,37,39,40,81,82,84,85,90,91,93,94,
%U A107681 108,109,111,112,117,118,120,121,0,1,3,4,9,10,12,13,27,28,30,31,36,37
%N A107681 Repeat(first 2^k numbers with no 2 in ternary representation) for k>0.
%C A107681 let A032924(n) = Sum(d(i)*3^i: 0<d(i)<3, 0<=i<L)
%C A107681 then .... a(n) = Sum((d(i)-1)*3^i: 0<=i<L);
%C A107681 A032924(n) = A107680(n) + a(n);
%C A107681 A081604 (a(n)) <= A081604(A107680(n)) = A081604(A032924(n)) = A000523(n+1).
%F A107681 a(n) = A005836(A062050(n+1)).
%e A107681 A032924(177) = A107680(177) + a(177),
%e A107681 ....... 1420 = ....... 1093 + 327,
%e A107681 .. '1221121' = ... '1111111'+ '110010',
%e A107681 ............ = . A003462(7) + A005836(51).
%Y A107681 Cf. A007089.
%Y A107681 Sequence in context: A061353 A016653 A096088 this_sequence A021298 A073234 
               A123685
%Y A107681 Adjacent sequences: A107678 A107679 A107680 this_sequence A107682 A107683 
               A107684
%K A107681 nonn
%O A107681 1,5
%A A107681 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2005

    
page 1

Search completed in 0.001 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research