Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006936
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A006936
%S A006936 0,1,0,2,12,74,538,4682,47280,545832,7087186,102247562,1622632020,
%T A006936 28091567594,526858343698,10641342970366,230283190930560,
%U A006936 5315654681981354,130370767028589528,3385534663256845322
%N A006936 Moebius transform of numbers of preferential arrangements.
%C A006936 Moebius transform of A000670(n-1)=[1,1,3,13,75,...] is a(n)=[1,0,2,12,
               74,...]. - Michael Somos Mar 04 2004
%H A006936 N. J. A. Sloane, <a href="transforms.txt">Transforms</a>
%o A006936 (PARI) a(n)=if(n<1,0,sumdiv(n,d,moebius(n/d)*(d-1)!*polcoeff(1/(2-exp(x+O(x^d))),
               d-1)))
%Y A006936 Cf. A000670.
%Y A006936 Sequence in context: A078469 A014351 A074616 this_sequence A052875 A037725 
               A037620
%Y A006936 Adjacent sequences: A006933 A006934 A006935 this_sequence A006937 A006938 
               A006939
%K A006936 nonn
%O A006936 0,4
%A A006936 N. J. A. Sloane (njas(AT)research.att.com).

    
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