Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136405
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A136405
%S A136405 1,1,2,1,1,3,1,3,2,5,1,2,4,3,7,1,4,6,7,5,11,1,3,7,8,11,7,15,1,5,8,16,
%T A136405 14,17,11,22,1,4,12,14,23,21,25,15,30,1,6,12,24,29,38,33,37,22,42,1
%N A136405 Array read by rows: T(n,k) is the number of bi-partitions of the pair 
               (n,k) into pairs (n_i,k_i) of positive integers such that sum k_i 
               = k and sum n_i.k_i = n.
%C A136405 T(n,1) = 1, T(n,2) = A028242(n) and T(n,n) = A000041(n).
%C A136405 Row sums: A006171.
%e A136405 T(4,2) = 3 since (4,2) can be bi-partitioned as (2,2) or ((1,1),(3,1)) 
               or ((2,1),(2,1)).
%e A136405 T(5,3) = 4 since (5,3) can be bi-partitioned as ((1,1),(2,2)) or ((3,
               1),(1,2)) or ((1,1),(1,1),(3,1)) or ((1,1),(2,1),(2,1)).
%Y A136405 Cf. A090806.
%Y A136405 Sequence in context: A029288 A050117 A121560 this_sequence A035667 A102426 
               A092865
%Y A136405 Adjacent sequences: A136402 A136403 A136404 this_sequence A136406 A136407 
               A136408
%K A136405 nonn,tabl
%O A136405 1,3
%A A136405 Benoit Jubin (benoit_jubin(AT)yahoo.fr), Apr 13 2008, Apr 22 2008, May 
               17 2008

    
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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research