Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136281
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A136281
%S A136281 1,2,8,41,253,1858,15796,152219,1638323,19467494,252998224,3568259503,
%T A136281 54263159347,884834059454,15397757661092,284767413357977,
%U A136281 5576696746139689,115269732256964626,2507575465491619672,57262481225957071721,
               1369461739453440893261
%N A136281 Number of graphs on n labeled nodes with degree at most 2.
%D A136281 D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
%F A136281 Binomial transform of A000986. E.g.f.: (1-x)^(-1/2)*exp(-x^2/4 + x/((2*(1-x)))). 
               - Vladeta Jovovic (vladeta(AT)eunet.rs), May 20 2008
%Y A136281 Cf. A000085 (degree at most 1), A136282-A136286.
%Y A136281 Sequence in context: A093935 A099240 A134055 this_sequence A125698 A052447 
               A153537
%Y A136281 Adjacent sequences: A136278 A136279 A136280 this_sequence A136282 A136283 
               A136284
%K A136281 nonn
%O A136281 1,2
%A A136281 D. E. Knuth, Mar 31 2008
%E A136281 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), May 20 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research