Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053734
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A053734
%S A053734 0,0,1,0,1,1,1,0,2,1,1,2,1,1,5,0,1,6,1,2,11,1,1,16,4,1,30,2,1,57,
%T A053734 1,0,95,1,13,172,1,1,317,16,1,591,1,2,1124,1,1,2048,10,52,3857,
%U A053734 2,1,7286,97,16,13799,1,1,26386,1,1,49968,0,319,95331,1,2,182363
%N A053734 A000016-A000048 (when they are lined up so that the two 16's match).
%p A053734 f := proc(n) local d,sum1; sum1 := 0; for d from 1 to n do if d mod 2 
               = 1 and n mod d = 0 then sum1 := sum1+(phi(d)-mobius(d))*2^(n/d); 
               fi; od; sum1/(2*n); end;
%Y A053734 Sequence in context: A035693 A068696 A133009 this_sequence A057856 A117939 
               A105522
%Y A053734 Adjacent sequences: A053731 A053732 A053733 this_sequence A053735 A053736 
               A053737
%K A053734 nonn
%O A053734 1,9
%A A053734 N. J. A. Sloane (njas(AT)research.att.com), Mar 25 2000

    
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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research